Derivation of collocated motion vectors

ABSTRACT

A method of video processing is described. The method includes: making a first determination about whether a collocated video block of a video block of a video is coded using an inter coding mode or a non-inter coding mode; making a second determination, based on the first determination, about availability of motion vectors of the collocated video block or a mode of derivation of motion vectors for the collocated video block; and performing a conversion between the video block and a coded representation of the video based on the second determination.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Patent ApplicationNo. PCT/CN2020/114760, filed on Sep. 11, 2020, which claims the priorityto and benefit of International Patent Application No.PCT/CN2019/105825, filed on Sep. 13, 2019. For all purposes under thelaw, the entire disclosure of the aforementioned applications areincorporated by reference as part of the disclosure of this application.

TECHNICAL FIELD

This document is related to video and image coding and decodingtechnologies.

BACKGROUND

Digital video accounts for the largest bandwidth use on the internet andother digital communication networks. As the number of connected userdevices capable of receiving and displaying video increases, it isexpected that the bandwidth demand for digital video usage will continueto grow.

SUMMARY

Devices, systems and methods related to digital video processing, andspecifically, to collocated motion vector in video processing aredescribed. The described methods may be applied to both the existingvideo coding standards (e.g., High Efficiency Video Coding (HEVC)) andfuture video coding standards (e.g., Versatile Video Coding (VVC)) orcodecs.

In one exemplary aspect, a method of video processing is disclosed. Themethod includes making a first determination about whether a collocatedvideo block of a video block of a video is coded using an inter codingmode or a non-inter coding mode; making a second determination, based onthe first determination, about availability of motion vectors of thecollocated video block or a mode of derivation of motion vectors for thecollocated video block; and performing a conversion between the videoblock and a coded representation of the video based on the seconddetermination.

In another exemplary aspect, a method of video processing is disclosed.The method includes determining, for a conversion between a video blockof a video and a coded representation of the video, one or morecollocated motion vectors based on a reference index or a reference listof a collocated video block of the video block; and performing theconversion based on the determining.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, aprediction block for the current block that is determined according to abi-directional coding unit level weighting (BCW) tool in which weightsare used to determine a weighted sum of two initial prediction blocksused to determine the prediction block; and performing the conversionusing the prediction block, wherein the deriving of the prediction blockcomprises: applying the weights to two intermediate prediction samplesthat respectively belong to the two initial prediction blocks to derivea final prediction sample; and performing a right shift operation forthe final prediction sample to convert a bit depth of the finalprediction sample, wherein the right shift operation is pbSample>>(shift1+3)), wherein pbSample represents the final prediction sample,shiftl is set equal to Max(2, 14−bitDepth); and determining theprediction block based on the final prediction sample.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, aprediction block for the current block that is determined according to abi-directional coding unit level weighting (BCW) tool in which weightsare used to determine a weighted sum of two initial prediction blocksused to determine the prediction block; and performing the conversionusing the prediction block; wherein the deriving of the prediction blockcomprises: applying the weights to two intermediate prediction samplethat respectively belong to the two initial prediction blocks to derivea final prediction sample; and adding an offset to the final predictionsample, wherein the offset is 1<< (shiftl+2), wherein shiftl is setequal to Max(2, 14−bitDepth); and determining the prediction block basedon the final prediction sample.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, amotion vector difference for a merge mode motion vector predictor forthe current block according to a rule; and performing the conversionbased on the deriving, wherein the rule specifies whether to clip themotion vector difference to a same range as a range used for clippingmotion vectors.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, aprediction block for the current block that is determined according to abi-directional coding unit level weighting (BCW) tool in which weightsare used to determine a weighted sum of two initial prediction blocksused to determine the prediction block, wherein at least one of theweights belongs to a weight table, wherein the weight table is organizedaccording to a rule; and performing the conversion using the predictionblock, wherein the rule specifies that entries of the weight table arenon-monotonically increasing.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, aprediction block for the current block that is determined according to abi-directional coding unit level weighting (BCW) tool in which weightsare used to determine a weighted sum of two initial prediction blocksused to determine the prediction block, wherein at least one of theweights belongs to a weight table, and the weight table is selected frommultiple weight tables; and performing the conversion using theprediction block.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, aprediction block for the current block that is determined according to abi-directional coding unit level weighting (BCW) tool in which weightsare used to determine a weighted sum of two initial prediction blocksused to determine the prediction block; and performing the conversionusing the prediction block, wherein the deriving of the prediction blockcomprises: converting an intermediate prediction sample to a first bitdepth; applying the weights to the intermediate prediction sample toderive a final prediction sample; and converting the final predictionsample to a second bit depth.

In yet another exemplary aspect, a method of video processing isdisclosed. The method includes deriving, for a conversion between acurrent block of a video and a coded representation of the video, aprediction block for the current block that is determined according to abi-directional coding unit level weighting (BCW) tool in which a firstweight and a second weight are used to determine a weighted sum of twoinitial prediction blocks used to determine the prediction block,wherein at least one of the first weight and the second weight isincluded in a weight table, wherein the weight table is organizedaccording to a rule; and performing the conversion using the predictionblock, wherein the rule specifies that the weight table is asymmetric.

In yet another example aspect, the above-described method may beimplemented by a video encoder apparatus that comprises a processor.

In yet another example aspect, these methods may be embodied in the formof processor-executable instructions and stored on a computer-readableprogram medium.

These, and other, aspects are further described in the present document.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a block diagram of an example encoder.

FIG. 2 shows an example of 67 intra prediction modes.

FIG. 3 shows an example of horizontal and vertical traverse scans.

FIG. 4 shows an example of motion vector scaling for temporal mergecandidates.

FIG. 5 shows candidate positions for a temporal merge candidate.

FIG. 6A shows an example of spatial neighboring blocks used byAlternative Temporal Motion Vector Prediction (ATMVP).

FIG. 6B shows an example of deriving sub-CU motion field.

FIG. 7 shows an example of a search point for the merge with motionvector differences (MMVD) mode.

FIG. 8 is a flowchart for an example of a video processing method.

FIG. 9 is a flowchart for another example of a video processing method.

FIG. 10 is a flowchart for yet another example of a video processingmethod.

FIG. 11 is a flowchart for yet another example of a video processingmethod.

FIG. 12 is a flowchart for yet another example of a video processingmethod.

FIG. 13 is a flowchart for yet another example of a video processingmethod.

FIGS. 14A and 14B are block diagrams of examples of a hardware platformfor implementing a visual media decoding or a visual media encodingtechnique described in the present document.

FIGS. 15A to 15E are flowcharts of example methods of video processingbased on some implementations of the disclosed technology.

DETAILED DESCRIPTION

The present document provides various techniques that can be used by adecoder of image or video bitstreams to improve the quality ofdecompressed or decoded digital video or images. For brevity, the term“video” is used herein to include both a sequence of pictures(traditionally called video) and individual images. Furthermore, a videoencoder may also implement these techniques during the process ofencoding in order to reconstruct decoded frames used for furtherencoding.

Section headings are used in the present document for ease ofunderstanding and do not limit the embodiments and techniques to thecorresponding sections. As such, embodiments from one section can becombined with embodiments from other sections.

1. Summary

This document is related to video coding technologies. Specifically, itis related to collocated motion vectors and other coding tools. It maybe applied to the existing video coding standard like HEVC, or thestandard (Versatile Video Coding) to be finalized. It may be alsoapplicable to future video coding standards or video codec.

2. Initial Discussion

Video coding standards have evolved primarily through the development ofthe well-known ITU-T and ISO/IEC standards. The ITU-T produced H.261 andH.263, ISO/IEC produced MPEG-1 and MPEG-4 Visual, and the twoorganizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4Advanced Video Coding (AVC) and H.265/HEVC standards. Since H.262, thevideo coding standards are based on the hybrid video coding structurewherein temporal prediction plus transform coding are utilized. Toexplore the future video coding technologies beyond HEVC, Joint VideoExploration Team (JVET) was founded by VCEG and MPEG jointly in 2015.Since then, many new methods have been adopted by JVET and put into thereference software named Joint Exploration Model (JEM). In April 2018,the Joint Video Expert Team (JVET) between VCEG (Q6/16) and ISO/IEC JTC1SC29/WG11 (MPEG) was created to work on the VVC standard targeting at50% bitrate reduction compared to HEVC.

2.1 Color Space and Chroma Subsampling

Color space, also known as the color model (or color system), is anabstract mathematical model which simply describes the range of colorsas tuples of numbers, typically as 3 or 4 values or color components(e.g. RGB). Basically speaking, color space is an elaboration of thecoordinate system and sub-space.

For video compression, the most frequently used color spaces are YCbCrand RGB.

YCbCr, Y′CbCr, or Y Pb/Cb Pr/Cr, also written as YCBCR or Y′CBCR, is afamily of color spaces used as a part of the color image pipeline invideo and digital photography systems. Y′ is the luma component and CBand CR are the blue-difference and red-difference chroma components. Y′(with prime) is distinguished from Y, which is luminance, meaning thatlight intensity is nonlinearly encoded based on gamma corrected RGBprimaries.

Chroma subsampling is the practice of encoding images by implementingless resolution for chroma information than for luma information, takingadvantage of the human visual system's lower acuity for colordifferences than for luminance.

2.1.1 4:4:4

Each of the three Y′CbCr components have the same sample rate, thusthere is no chroma subsampling. This scheme is sometimes used inhigh-end film scanners and cinematic post production.

2.1.2 4:2:2

The two chroma components are sampled at half the sample rate of luma:the horizontal chroma resolution is halved. This reduces the bandwidthof an uncompressed video signal by one-third with little to no visualdifference.

2.1.3 4:2:0

In 4:2:0, the horizontal sampling is doubled compared to 4:1:1, but asthe Cb and Cr channels are only sampled on each alternate line in thisscheme, the vertical resolution is halved. The data rate is thus thesame. Cb and Cr are each subsampled at a factor of 2 both horizontallyand vertically. There are three variants of 4:2:0 schemes, havingdifferent horizontal and vertical siting.

In MPEG-2, Cb and Cr are cosited horizontally. Cb and Cr are sitedbetween pixels in the vertical direction (sited interstitially).

In JPEG/JFIF, H.261, and MPEG-1, Cb and Cr are sited interstitially,halfway between alternate luma samples.

In 4:2:0 DV, Cb and Cr are co-sited in the horizontal direction. In thevertical direction, they are co-sited on alternating lines.

2.2 Coding Flow of a Typical Video Codec

FIG. 1 shows an example of encoder block diagram of VVC, which containsthree in-loop filtering blocks: deblocking filter (DF), sample adaptiveoffset (SAO) and ALF. Unlike DF, which uses predefined filters, SAO andALF utilize the original samples of the current picture to reduce themean square errors between the original samples and the reconstructedsamples by adding an offset and by applying a finite impulse response(FIR) filter, respectively, with coded side information signalling theoffsets and filter coefficients. ALF is located at the last processingstage of each picture and can be regarded as a tool trying to catch andfix artifacts created by the previous stages.

2.3 Intra Mode Coding with 67 Intra Prediction Modes

To capture the arbitrary edge directions presented in natural video, thenumber of directional intra modes is extended from 33, as used in HEVC,to 65. The additional directional modes are depicted as red dottedarrows in FIG. 2, and the planar and DC modes remain the same. Thesedenser directional intra prediction modes apply for all block sizes andfor both luma and chroma intra predictions.

Conventional angular intra prediction directions are defined from 45degrees to −135 degrees in clockwise direction as shown in FIG. 2. InVTM6, several conventional angular intra prediction modes are adaptivelyreplaced with wide-angle intra prediction modes for the non-squareblocks. The replaced modes are signaled using the original method andremapped to the indexes of wide angular modes after parsing. The totalnumber of intra prediction modes is unchanged, i.e., 67, and the intramode coding is unchanged.

In the HEVC, every intra-coded block has a square shape and the lengthof each of its side is a power of 2. Thus, no division operations arerequired to generate an intra-predictor using DC mode. In VVC, blockscan have a rectangular shape that necessitates the use of a divisionoperation per block in the general case. To avoid division operationsfor DC prediction, only the longer side is used to compute the averagefor non-square blocks.

2.4 Inter Prediction

For each inter-predicted CU, motion parameters consisting of motionvectors, reference picture indices and reference picture list usageindex, and additional information needed for the new coding feature ofVVC to be used for inter-predicted sample generation. The motionparameter can be signalled in an explicit or implicit manner. When a CUis coded with skip mode, the CU is associated with one PU and has nosignificant residual coefficients, no coded motion vector delta orreference picture index. A merge mode is specified whereby the motionparameters for the current CU are obtained from neighbouring CUs,including spatial and temporal candidates, and additional schedulesintroduced in VVC. The merge mode can be applied to any inter-predictedCU, not only for skip mode. The alternative to merge mode is theexplicit transmission of motion parameters, where motion vector,corresponding reference picture index for each reference picture listand reference picture list usage flag and other needed information aresignalled explicitly per each CU.

2.5 Intra Block Copy (IBC)

Intra block copy (IBC) is a tool adopted in HEVC extensions on SCC. Itis well known that it significantly improves the coding efficiency ofscreen content materials. Since IBC mode is implemented as a block levelcoding mode, block matching (BM) is performed at the encoder to find theoptimal block vector (or motion vector) for each CU. Here, a blockvector is used to indicate the displacement from the current block to areference block, which is already reconstructed inside the currentpicture. The luma block vector of an IBC-coded CU is in integerprecision. The chroma block vector rounds to integer precision as well.When combined with AMVR, the IBC mode can switch between 1-pel and 4-pelmotion vector precisions. An IBC-coded CU is treated as the thirdprediction mode other than intra or inter prediction modes. The IBC modeis applicable to the CUs with both width and height smaller than orequal to 64 luma samples.

At the encoder side, hash-based motion estimation is performed for IBC.The encoder performs RD check for blocks with either width or height nolarger than 16 luma samples. For non-merge mode, the block vector searchis performed using hash-based search first. If hash search does notreturn valid candidate, block matching based local search will beperformed.

In the hash-based search, hash key matching (32-bit CRC) between thecurrent block and a reference block is extended to all allowed blocksizes. The hash key calculation for every position in the currentpicture is based on 4×4 sub-blocks. For the current block of a largersize, a hash key is determined to match that of the reference block whenall the hash keys of all 4×4 sub-blocks match the hash keys in thecorresponding reference locations. If hash keys of multiple referenceblocks are found to match that of the current block, the block vectorcosts of each matched reference are calculated and the one with theminimum cost is selected.

In block matching search, the search range is set to cover both theprevious and current CTUs.

At CU level, IBC mode is signalled with a flag and it can be signaled asIBC AMVP mode or IBC skip/merge mode as follows:

IBC skip/merge mode: a merge candidate index is used to indicate whichof the block vectors in the list from neighboring candidate IBC codedblocks is used to predict the current block. The merge list consists ofspatial, HMVP, and pairwise candidates.

IBC AMVP mode: block vector difference is coded in the same way as amotion vector difference. The block vector prediction method uses twocandidates as predictors, one from left neighbor and one from aboveneighbor (if IBC coded). When either neighbor is not available, adefault block vector will be used as a predictor. A flag is signaled toindicate the block vector predictor index.

2.6 Palette Mode

For palette mode signaling, the palette mode is coded as a predictionmode for a coding unit, i.e., the prediction modes for a coding unit canbe MODE_INTRA, MODE_INTER, MODE_IBC and MODE_PLT. If the palette mode isutilized, the pixels values in the CU are represented by a small set ofrepresentative colour values. The set is referred to as the palette. Forpixels with values close to the palette colors, the palette indices aresignalled. For pixels with values outside the palette, the pixel isdenoted with an escape symbol and the quantized pixel values aresignaled directly.

To decode a palette encoded block, the decoder needs to decode palettecolors and indices. Palette colors are described by a palette table andencoded by palette table coding tools. An escape flag is signaled foreach CU to indicate if escape symbols are present in the current CU. Ifescape symbols are present, the palette table is augmented by one andthe last index is assigned to the escape mode. Palette indices of allpixels in a CU form a palette index map and are encoded by palette indexmap coding tools.

For coding of the palette table, a palette predictor is maintained. Thepredictor is initialized at the beginning of each slice where predictoris reset to 0. For each entry in the palette predictor, a reuse flag issignalled to indicate whether it is part of the current palette. Thereuse flags are sent using run-length coding of zeros. After this, thenumber of new palette entries are signalled using exponential Golombcode of order 0. Finally, the component values for the new paletteentries are signalled. After encoding the current CU, the palettepredictor will be updated using the current palette, and entries fromthe previous palette predictor which are not reused in the currentpalette will be added at the end of new palette predictor until themaximum size allowed is reached (palette stuffing).

For coding the palette index map, the indices are coded using horizontaland vertical traverse scans as shown in FIG. 3. The scan order isexplicitly signalled in the bitstream using the palette_transpose_flag.

The palette indices are coded using two main palette sample modes:‘INDEX’ and ‘COPY_ABOVE’. The mode is signalled using a flag except forthe top row when horizontal scan is used, the first column when thevertical scan is used, or when the previous mode was ‘COPY_ABOVE’. Inthe ‘COPY_ABOVE’ mode, the palette index of the sample in the row aboveis copied. In the ‘INDEX’ mode, the palette index is explicitlysignalled. For both ‘INDEX’ and ‘COPY_ABOVE’ modes, a run value issignalled which specifies the number pixels that are coded using thesame mode.

The encoding order for index map is as follows: First, the number ofindex values for the CU is signalled. This is followed by signalling ofthe actual index values for the entire CU using truncated binary coding.Both the number of indices as well as the index values are coded inbypass mode. This groups the index-related bypass bins together. Thenthe palette mode (INDEX or COPY_ABOVE) and run are signalled in aninterleaved manner. Finally, the component escape values correspondingto the escape samples for the entire CU are grouped together and codedin bypass mode. An additional syntax element, last_run_type_flag, issignalled after signalling the index values. This syntax element, inconjunction with the number of indices, eliminates the need to signalthe run value corresponding to the last run in the block.

In VTM5.0, dual tree is enabled for I slice which separate the codingunit partitioning for Luma and Chroma. Hence, in this proposal, paletteis applied on Luma (Y component) and Chroma (Cb and Cr components)separately. If dual tree is disabled, palette will be applied on Y, Cb,Cr components jointly, same as in HEVC palette.

2.7 Temporal Motion Vector Prediction (TMVP) in VVC

In the derivation of this temporal merge candidate, a scaled motionvector is derived based on co-located CU belonging to the collocatedreferenncee picture. The reference picture list to be used forderivation of the co-located CU is explicitly signalled in the sliceheader. The scaled motion vector for temporal merge candidate isobtained as illustrated by the dotted line in FIG. 4, which is scaledfrom the motion vector of the co-located CU using the POC distances, tband td, where tb is defined to be the POC difference between thereference picture of the current picture and the current picture and tdis defined to be the POC difference between the reference picture of theco-located picture and the co-located picture. The reference pictureindex of temporal merge candidate is set equal to zero.

The position for the temporal candidate is selected between candidatesC₀ and C₁, as depicted in FIG. 5. If CU at position C₀ is not available,is intra coded, or is outside of the current row of CTUs, position C₁ isused. Otherwise, position Co is used in the derivation of the temporalmerge candidate.

2.8 Subblock-Based Temporal Motion Vector Prediction (SbTMVP) in VVC

VTM supports the subblock-based temporal motion vector prediction(SbTMVP) method. Similar to the temporal motion vector prediction (TMVP)in HEVC, SbTMVP uses the motion field in the collocated picture toimprove motion vector prediction and merge mode for CUs in the currentpicture. The same collocated picture used by TMVP is used for SbTVMP.SbTMVP differs from TMVP in the following two main aspects:

1. TMVP predicts motion at CU level but SbTMVP predicts motion at sub-CUlevel;

2. Whereas TMVP fetches the temporal motion vectors from the collocatedblock in the collocated picture (the collocated block is thebottom-right or center block relative to the current CU), SbTMVP appliesa motion shift before fetching the temporal motion information from thecollocated picture, where the motion shift is obtained from the motionvector from one of the spatial neighboring blocks of the current CU.

The SbTVMP process is illustrated in FIG. 6. SbTMVP predicts the motionvectors of the sub-CUs within the current CU in two steps. In the firststep, the spatial neighbor A1 in FIG. 6A is examined. If A1 has a motionvector that uses the collocated picture as its reference picture, thismotion vector is selected to be the motion shift to be applied. If nosuch motion is identified, then the motion shift is set to (0, 0).

In the second step, the motion shift identified in Step 1 is applied(i.e. added to the current block's coordinates) to obtain sub-CU-levelmotion information (motion vectors and reference indices) from thecollocated picture as shown in FIG. 6B. The example in FIG. 6B assumesthe motion shift is set to block A1's motion. Then, for each sub-CU, themotion information of its corresponding block (the smallest motion gridthat covers the center sample) in the collocated picture is used toderive the motion information for the sub-CU. After the motioninformation of the collocated sub-CU is identified, it is converted tothe motion vectors and reference indices of the current sub-CU in asimilar way as the TMVP process of HEVC, where temporal motion scalingis applied to align the reference pictures of the temporal motionvectors to those of the current CU.

In VTM6, a combined sub-block based merge list which contains bothSbTVMP candidate and affine merge candidates is used for the signallingof sub-block based merge mode. The SbTVMP mode is enabled/disabled by asequence parameter set (SPS) flag. If the SbTMVP mode is enabled, theSbTMVP predictor is added as the first entry of the list of sub-blockbased merge candidates, and followed by the affine merge candidates. Thesize of sub-block based merge list is signalled in SPS and the maximumallowed size of the sub-block based merge list is 5 in VTM6.

The sub-CU size used in SbTMVP is fixed to be 8×8, and as done foraffine merge mode, SbTMVP mode is only applicable to the CU with bothwidth and height are larger than or equal to 8.

The encoding logic of the additional SbTMVP merge candidate is the sameas for the other merge candidates, that is, for each CU in P or B slice,an additional RD check is performed to decide whether to use the SbTMVPcandidate.

Description of TMVP and SbTMVP in Working Draft 8.5.2.11 DerivationProcess for Temporal Luma Motion Vector Prediction

Inputs to this process are:

a luma location (xCb, yCb) of the top-left sample of the current lumacoding block relative to the top-left luma sample of the currentpicture,a variable cbWidth specifying the width of the current coding block inluma samples,a variable cbHeight specifying the height of the current coding block inluma samples,a reference index refldxLX, with X being 0 or 1.Outputs of this process are:the motion vector prediction mvLXCol in 1/16 fractional-sample accuracy,the availability flag availableFlagLXCol.The variable currCb specifies the current luma coding block at lumalocation (xCb, yCb).The variables mvLXCol and availableFlagLXCol are derived as follows:

-   -   If slice_temporal_mvp_enabled_flag is equal to 0 or        (cbWidth*cbHeight) is less than or equal to 32, both components        of mvLXCol are set equal to 0 and availableFlagLXCol is set        equal to 0.    -   Otherwise (slice_temporal_mvp_enabled_flag is equal to 1), the        following ordered steps apply:

1. The bottom right collocated motion vector and the bottom and rightboundary sample locations are derived as follows:

$\begin{matrix}{{xColBr} = {{xCb} + {cbWidth}}} & \left( {8\text{-}421} \right) \\{{yColBr} = {{yCb} + {cbHeight}}} & \left( {8\text{-}422} \right) \\{{rightBoundaryPos} = {{{subpic\_ treated}{\_ as}{\_ pic}{{{\_ flag}\lbrack\mspace{11mu}{SubPicIdx}\mspace{11mu}\rbrack}\mspace{11mu}?{SubPicRightBoundaryPos}}\mspace{14mu}\text{:}\mspace{20mu}{pic\_ width}{\_ in}{\_ luma}{\_ samples}} - 1}} & \left( {8\text{-}423} \right) \\{{botBoundaryPos} = {{{subpic\_ treated}{\_ as}{\_ pic}{{{\_ flag}\lbrack\mspace{11mu}{SubPicIdx}\mspace{11mu}\rbrack}\mspace{11mu}?{SubPicBotBoundaryPos}}\mspace{14mu}\text{:}\mspace{20mu}{pic\_ heigth}{\_ in}{\_ luma}{\_ samples}} - 1}} & \left( {8\text{-}424} \right)\end{matrix}$

-   -   If yCb>>CtbLog2SizeY is equal to yColBr>>CtbLog2SizeY, yColBr is        less than or equal to botBoundaryPos and xColBr is less than or        equal to rightBoundaryPos, the following applies:        -   The variable colCb specifies the luma coding block covering            the modified location given by ((xColBr>>3) <<3,            (yColBr >>3) <<3) inside the collocated picture specified by            ColPic.        -   The luma location (xColCb, yColCb) is set equal to the            top-left sample of the collocated luma coding block            specified by colCb relative to the top-left luma sample of            the collocated picture specified by ColPic.        -   The derivation process for collocated motion vectors as            specified in clause 8.5.2.12 is invoked with currCb, colCb,            (xColCb, yColCb), refldxLX and sbFlag set equal to 0 as            inputs, and the output is assigned to mvLXCol and            availableFlagLXCol.    -   Otherwise, both components of mvLXCol are set equal to 0 and        availableFlagLXCol is set equal to 0.

2. When availableFlagLXCol is equal to 0, the central collocated motionvector is derived as follows:

$\begin{matrix}{{xColCtr} = {{xCb} + \left( \mspace{11mu}{{cbWidth}\mspace{11mu} ⪢ 1}\; \right)}} & \left( {8\text{-}425} \right) \\{{yColCtr} = {{yCb} + \left( \mspace{11mu}{{cbHeight}\mspace{11mu} ⪢ 1}\; \right)}} & \left( {8\text{-}426} \right)\end{matrix}$

-   -   The variable colCb specifies the luma coding block covering the        modified location given by ((xColCtr >>3) <<3, (yColCtr >>3)        <<3) inside the collocated picture specified by ColPic.    -   The luma location (xColCb, yColCb) is set equal to the top-left        sample of the collocated luma coding block specified by colCb        relative to the top-left luma sample of the collocated picture        specified by ColPic.    -   The derivation process for collocated motion vectors as        specified in clause 8.5.2.12 is invoked with currCb, colCb,        (xColCb, yColCb), refldxLX and sbFlag set equal to 0 as inputs,        and the output is assigned to mvLXCol and availableFlagLXCol.

8.5.2.12 Derivation Process for Collocated Motion Vectors

Inputs to this process are:a variable currCb specifying the current coding block,a variable colCb specifying the collocated coding block inside thecollocated picture specified by ColPic,a luma location (xColCb, yColCb) specifying the top-left sample of thecollocated luma coding block specified by colCb relative to the top-leftluma sample of the collocated picture specified by ColPic,a reference index refldxLX, with X being 0 or 1,a flag indicating a subblock temporal merging candidate sbFlag.Outputs of this process are:the motion vector prediction mvLXCol in 1/16 fractional-sample accuracy,the availability flag availableFlagLXCol.The variable currPic specifies the current picture.The arrays predFlagL0Col[x][y ], mvL0Col[x][y] and refldxL0Col[x][y] areset equal to PredFlagLO[x][y], MvDmvrLO[x ][y ] and RefldxL0[x][y],respectively, of the collocated picture specified by ColPic, and thearrays predFlagL1Col[x][y], mvL1Col[x][y] and refldxL1Col[x][y] are setequal to PredFlagL1[x][y], MvDmvrLl[x][y] and RefldxL1[x][y ],respectively, of the collocated picture specified by ColPic.

The variables mvLXCol and availableFlagLXCol are derived as follows:

2.8.1 Derivation for Collocated Motion Vectors when ColCb is Coded in anInter Block

If sbFlag is equal to 0, availableFlagLXCol is set to 1 and thefollowing applies:

If predFlagL1Col[ xColCb][yColCb] is equal to 0, mvCol, refldxCol andlistCol are set equal to mvL1Col[xColCb ][ yColCb], refIdxL1Col[xColCb][yColCb] and L1, respectively.

Otherwise, if predFlagL0Col[xColCb][yColCb] is equal to 1 andpredFlagL1CollxColCb][yColCb] is equal to 0, mvCol, refldxCol andlistCol are set equal to mvL0Col[xColCb][yColCb],refIdxL0Col[xColCb][yColCb] and L0, respectively.

Otherwise (predFlagL0Col[ xColCb][yColCb] is equal to 1 andpredFlagL1Col[xColCb][yColCb] is equal to 1), the following assignmentsare made:

-   -   If NoBackwardPredFlag is equal to 1, mvCol, refldxCol and        listCol are set equal to mvLXCol[xColCb][yColCb],        refIdxLXCol[xColCb][yColCb] and LX, respectively.    -   Otherwise, mvCol, refldxCol and listCol are set equal to        mvLNCol[xColCb][yColCb], refIdxLNCol[xColCb][yColCb] and LN,        respectively, with N being the value of collocated_from_10_flag.

Otherwise (sbFlag is equal to 1), the following applies:

-   -   If PredFlagLXCol[xColCb][yColCb] is equal to 1, mvCol,        refldxCol, and listCol are set equal to mvLXCol[xColCb][yColCb],        refIdxLXCol[xColCb][yColCb], and LX, respectively,        availableFlagLXCol is set to 1.

Otherwise (PredFlagLXCol[xColCb][yColCb] is equal to 0), the followingapplies:

-   -   If NoBackwardPredFlag is equal to 1 and        PredFlagLYCol[xColCb][yColCb] is equal to 1, mvCol, refldxCol,        and listCol are set to mvLYCol[xColCb][yColCb],        refIdxLYCol[xColCb][yColCb] and LY, respectively, with Y being        equal to !X where X being the value of X this process is invoked        for. availableFlagLXCol is set equal to 1.    -   Otherwise, both components of mvLXCol are set equal to 0 and        availableFlagLXCol is set equal to 0.

When availableFlagLXCol is equal to TRUE, mvLXCol and availableFlagLXColare derived as follows:

-   -   If LongTermRefPic(currPic, currCb, refldxLX, LX) is not equal to        LongTermRefPic(ColPic, colCb, refldxCol, listCol), both        components of mvLXCol are set equal to 0 and availableFlagLXCol        is set equal to 0.    -   Otherwise, the variable availableFlagLXCol is set equal to 1,        refPicList[listCol][refldxCol] is set to be the picture with        reference index refldxCol in the reference picture list listCol        of the slice containing coding block colCb in the collocated        picture specified by ColPic, and the following applies:

$\begin{matrix}{{colPocDiff} = {{DiffPicOrderCnt}\left( {{ColPic},{{{refPicList}\lbrack{listCol}\rbrack}\lbrack{refIdxCol}\rbrack}} \right)}} & \left( {8\text{-}427} \right) \\{{currPocDiff} = {{DiffPicOrderCnt}\left( {{currPic},{{{RefPicList}\lbrack X\rbrack}\lbrack{refIdxLX}\rbrack}} \right)}} & \left( {8\text{-}428} \right)\end{matrix}$

The temporal motion buffer compression process for collocated motionvectors as specified in clause 8.5.2.15 is invoked with mvCol as input,and the modified mvCol as output.

If RefPicList[X][ refIdxLX] is a long-term reference picture, orcolPocDiff is equal to currPocDiff, mvLXCol is derived as follows:

$\begin{matrix}{{mvLXCol} = {mvCol}} & \left( {8\text{-}429} \right)\end{matrix}$

Otherwise, mvLXCol is derived as a scaled version of the motion vectormvCol as follows:

$\begin{matrix}{{tx} = {\left( {16384 + \left( {{{Abs}({td})} ⪢ 1} \right)} \right)/{td}}} & \left( {8\text{-}430} \right) \\{{distScaleFactor} = {{Clip}\; 3\left( {{- 4096},4095,{\left( {{{tb}*{tx}} + 32} \right) ⪢ 6}} \right)}} & \left( {8\text{-}431} \right) \\\left. {{mvLXCol} = {{Clip}\; 3\left( {{- 131072},131071,{\left( {{{distScaleFactor}*{mvCol}\mspace{11mu} 128} - \left( {{{distScaleFactor}*{mvCol}}>=0} \right)} \right) ⪢ 8}} \right)}} \right) & \left( {8\text{-}432} \right)\end{matrix}$

where td and tb are derived as follows:

$\begin{matrix}{{td} = {{Clip}\; 3\left( {{- 128},127,{colPocDiff}} \right)}} & \left( {8\text{-}433} \right) \\{{td} = {{Clip}\; 3\left( {{- 128},127,{currPocDiff}} \right)}} & \left( {8\text{-}434} \right)\end{matrix}$

2.9 Bi-Prediction with CU-Level Weight (BCW)

In HEVC, the bi-prediction signal is generated by averaging twoprediction signals obtained from two different reference pictures and/orusing two different motion vectors. In VTM6, the bi-prediction mode isextended beyond simple averaging to allow weighted averaging of the twoprediction signals.

$\begin{matrix}{P_{{bi}\text{-}{pred}} = {\left( {{\left( {8 - w} \right)*P_{0}} + {w*P_{1}} + 4} \right) ⪢ 3}} & \left( {3\text{-}19} \right)\end{matrix}$

Five weights are allowed in the weighted averaging bi-prediction, w∈{-2,3,4,5,10}. For each bi-predicted CU, the weight w is determined inone of two ways: 1) for a non-merge CU, the weight index is signalledafter the motion vector difference; 2) for a merge CU, the weight indexis inferred from neighbouring blocks based on the merge candidate index.Weighted averaging bi-prediction is only applied to CUs with 256 or moreluma samples (i.e., CU width times CU height is greater than or equal to256). For low-delay pictures, all 5 weights are used. For non-low-delaypictures, only 3 weights (w ∈{3,4,5}) are used.

At the encoder, fast search algorithms are applied to find the weightindex without significantly increasing the encoder complexity. Thesealgorithms are summarized as follows. For further details readers arereferred to the VTM software and document JVET-L0646. When combined withAMVR, unequal weights are only conditionally checked for 1-pel and 4-pelmotion vector precisions if the current picture is a low-delay picture.

When combined with affine, affine ME will be performed for unequalweights if and only if the affine mode is selected as the current bestmode.

When the two reference pictures in bi-prediction are the same, unequalweights are only conditionally checked.

Unequal weights are not searched when certain conditions are met,depending on the POC distance between current picture and its referencepictures, the coding QP, and the temporal level.

The BCW weight index is coded using one context coded bin followed bybypass coded bins. The first context coded bin indicates if equal weightis used; and if unequal weight is used, additional bins are signalledusing bypass coding to indicate which unequal weight is used.

Weighted prediction (WP) is a coding tool supported by the H.264/AVC andHEVC standards to efficiently code video content with fading. Supportfor WP was also added into the VVC standard. WP allows weightingparameters (weight and offset) to be signalled for each referencepicture in each of the reference picture lists L0 and L1. Then, duringmotion compensation, the weight(s) and offset(s) of the correspondingreference picture(s) are applied. WP and BCW are designed for differenttypes of video content. In order to avoid interactions between WP andBCW, which will complicate VVC decoder design, if a CU uses WP, then theBCW weight index is not signalled, and w is inferred to be 4 (i.e. equalweight is applied).For a merge CU, the weight index is inferred fromneighbouring blocks based on the merge candidate index. This can beapplied to both normal merge mode and inherited affine merge mode. Forconstructed affine merge mode, the affine motion information isconstructed based on the motion information of up to 3 blocks. Thefollowing process is used to derive the BCW index for a CU using theconstructed affine merge mode.

1. Divide the range of BCW index {0,1,2,3,4} into three groups {0,},{41,2,3} and {4}. If all of the control point's BCW indices are from thesame group, the BCW index is derived as in the step 2; otherwise, theBCW index is set to 2.

If at least two control points have the same BCW index, then this BCWindex value is assigned to the candidate; else, the BCW index of thecurrent constructed candidate is set to 2.

2.10 Merge mode with MVD (MMVD)

In addition to merge mode, where the implicitly derived motioninformation is directly used for prediction samples generation of thecurrent CU, the merge mode with motion vector differences (MMVD) isintroduced in VVC. A MMVD flag is signaled right after sending a skipflag and merge flag to specify whether MMVD mode is used for a CU.

In MMVD, after a merge candidate is selected, it is further refined bythe signalled MVDs information. The further information includes a mergecandidate flag, an index to specify motion magnitude, and an index forindication of motion direction. In MMVD mode, one for the first twocandidates in the merge list is selected to be used as MV basis. Themerge candidate flag is signalled to specify which one is used.

Distance index specifies motion magnitude information and indicate thepre-defined offset from the starting point. As shown in FIG. 7, anoffset is added to either horizontal component or vertical component ofstarting MV. The relation of distance index and pre-defined offset isspecified in Table 1.

TABLE 1 The relation of distance index and pre-defined offset DistanceIDX 0 1 2 3 4 5  6  7 Offset (in unit of 1/4 1/2 1 2 4 8 16 32 lumasample)

Direction index represents the direction of the MVD relative to thestarting point. The direction index can represent of the four directionsas shown in Table2. It's noted that the meaning of MVD sign could bevariant according to the information of starting MVs. When the startingMVs is an un-prediction MV or bi-prediction MVs with both lists point tothe same side of the current picture (i.e. POCs of two references areboth larger than the POC of the current picture, or are both smallerthan the POC of the current picture), the sign in Table 2 specifies thesign of MV offset added to the starting MV. When the starting MVs isbi-prediction MVs with the two MVs point to the different sides of thecurrent picture (i.e. the POC of one reference is larger than the POC ofthe current picture, and the POC of the other reference is smaller thanthe POC of the current picture), the sign in Table 2 specifies the signof MV offset added to the listO MV component of starting MV and the signfor the list1 MV has opposite value.

TABLE 2 Sign of MV offset specified by direction index Direction IDX 0001 10 11 x-axis + − N/A N/A y-axis N/A N/A + −

2.11 Alternative luma Half-Pel Interpolation Filters

In JVET-N0309, alternative half-pel interpolation filters are proposed.

The switching of the half-pel luma interpolation filter is donedepending on the motion vector accuracy. In addition to the existingquarter-pel, full-pel, and 4-pel AMVR modes, a new half-pel accuracyAMVR mode is introduced. Only in case of half-pel motion vectoraccuracy, an alternative half-pel luma interpolation filter can beselected.

2.11.1 Half-Pel AMVR Mode

An additional AMVR mode for non-affine non-merge inter-coded CUs isproposed which allows signaling of motion vector differences at half-pelaccuracy. The existing AMVR scheme of the current VVC draft is extendedstraightforward in the following way: Directly following the syntaxelement amvr_flag, if amvr flag==1, there is a new context-modeledbinary syntax element hpel_amvr_flag which indicates usage of the newhalf-pel AMVR mode if hpel_amvr_flag==1. Otherwise, i.e. ifhpel_amvr_flag==0, the selection between full-pel and 4-pel AMVR mode isindicated by the syntax element amvrprecision flag as in the current VVCdraft.

2.11.2 Alternative Luma Half-Pel Interpolation Filters

For a non-affine non-merge inter-coded CU which uses half-pel motionvector accuracy (i.e., the half-pel AMVR mode), a switching between theHEVC/VVC half-pel luma interpolation filter and one or more alternativehalf-pel interpolation is made based on the value of a new syntaxelement if_idx. The syntax element if_idx is only signaled in case ofhalf-pel AMVR mode. In case of skip/merge mode using a spatial mergingcandidate, the value of the syntax element if_idx is inherited from theneighbouring block.

2.11.2.1 Test 1: One Alternative Half-Pel Interpolation Filter

In this test case, there is one 6-tap interpolation filter as analternative to the ordinary HEVC/VVC half-pel interpolation filter. Thefollowing table shows the mapping between the value of the syntaxelement if idx and the selected half-pel luma interpolation filter:

if_idx Binarization Filter Interpolation filter coefficients 0 0 Gauss(6-tap) [0, 3, 9, 20, 20, 9, 3, 0] 1 1 HEVC/VVC [−1, 4, −11, 40, 40,−11, 4, −1] (8-tap)

2.11.2.1 Test 2: Two Alternative Half-Pel Interpolation Filters

In this test case, there are two 8-tap interpolation filters as analternative to the ordinary HEVC/VVC half-pel interpolation filter. Thefollowing table shows the mapping between the value of the syntaxelement if idx and the selected half-pel luma interpolation filter:

if_idx Binarization Filter Interpolation filter coefficients 0 0 Filter1 (8-tap) [3, 6, 10, 13, 13, 10, 6, 3] 1 10 Filter 2 (8-tap) [−1, −1, 9,25, 25, 9, −1, −1] 2 11 HEVC/VVC [−1, 4, −11, 40, 40, −11, 4, −1](8-tap)

amvr_precision_idx is signalled to indicate whether the current CUemploys 1/2-pel, 1-pel or 4-pel MV preicision. There are 2 bins to becoded.

hpel_if idx is signalled to indicate whether the default half-pelinterpolation filter or alternative half-pel interpolation filters areused. When 2 alternative half-pel interpolation filters are used, thereare 2 bins to be coded.

3. Drawbacks of Existing Implementations

The current design of derivation of collocated motion vectors in interprediction has the following problems:

1. The derivation of the collocated motion vectors in TMVP and SbTMVPdepends on prediction mode of the collocated coding block. In currentVVC, If the collocated coding block is coded in an intra or IBCprediction mode, the collocated motion vectors are set equal to zeromotion vector. Therefore, even the collocated block is palette coded, itmay still return a collocated motion vector which is undefined sincethere is no motion vector associated with a palette prediction mode.

2. The derivation of weighted sample prediction may not be efficient inBCW.

3. In current VVC, MV is clipped to 18 bits. However, the merge motionvector difference is clipped to 16 bits, which may result accuracy loss.

4. The signaled cu_skip_flag may cause overhead bits. In current VVC,the maximum width and height of coding unit for IBC is 64. There is noneed to signal cu_skip_flag for blocks of either width or height islarger than 64 in I slice.

5. Alternative luma half-pel interpolation filters flag may be set equalto true even when the CU/PU/block has no half-pel or coarser MVcomponent.

4. Example methods for collocated motion vectors in video coding

The detailed inventions below should be considered as examples toexplain general concepts. These inventions should not be interpreted ina narrow way. Furthermore, these inventions can be combined in anymanner.

Derivation of the Collocated Motion Vectors

1. Instead of check whether the collocated coding block is intra or IBCcoded, how to derive the collocated motion vectors and/or theavailability of collocated motion vectors may depend on whether theprediction mode of the collocated coding block is inter or not. In thiscase, there is no need to store the four prediction modes for eachblock, only one 1 bit is required to tell whether the block is inter ornon-inter.

-   -   a. In one example, how to derive the collocated motion vectors        and/or the availability of collocated motion vectors for the        case that the collocated coding block is coded in palette        prediction mode may be the same as that for the case that the        collocated coding block is coded in intra/IBC prediction mode.    -   b. In one example, when the collocated coding block is coded in        a non-inter prediction mode (e.g., intra, palette, or IBC), the        collocated motion vector may be set to be unavailable.    -   c. Alternatively, collocated motion vectors may be marked as        available, and a default motion vector may be assigned as the        collocated motion vector when the collocated coding block is        coded in a non-inter prediction mode (e.g., intra, palette, or        IBC).    -   d. Alternatively, other blocks (e.g., one neighboring inter        coded block of the collocated coding block) may be checked        instead when the collocated coding block is coded in a non-inter        prediction mode.        -   i. In one example, the neighboring block may the nearest            inter coded block left/right/above/bottom the collocated            coding block.    -   2. The determination of the collocated motion vectors may depend        on the reference lists and/or reference indices of the        collocated coding block.        -   a. In one example, the collocated motion vectors may be            derived (e.g., using prior art as described in 2.8.1) when            the reference index of reference list X (e.g. L1) of the            collocated coding block is not equal to a specific value            (e.g., 0).        -   b. In one example, the derivation of the collocated motion            vectors may be invoked when the reference index of reference            list X (e.g. L1) of the collocated coding block is equal to            a specific value (e.g., 0).        -   c. Alternatively, furthermore, when the collocated coding            block is coded in a non-inter prediction mode (including or            excluding IBC), or its reference picture doesn't satisfy a            given condition, the collocated MV is set to be unavailable.        -   i. Alternatively, the collocated MV is set to a default            value.

Sample Prediction of BCW

-   -   3. The weight table applied in the BCW coding mode may be        asymmetry.        -   a. In one example, for a weight W as an entry of the table,            (1-W) may not be a table entry, wherein W is in the range of            [a, b] wherein (a +b) is equal to 1.        -   b. In one example, for a weight W as an entry of the table,            (2^(N)-W) may not be a table entry, assuming that the final            prediction block is generated by (WO*P030 W1*P1)>>N wherein            W0 and W1 are two weights applied to two prediction blocks            PO and P1, respectively; and (W0+W1) is equal to (1<<N).    -   4. The weights in the weight table applied in the BCW coding        mode may not be in a monotonically increasing order.

a. In one example, the (i+1)-th entry of the table may have a smallervalue than the i-th entry of the table.

-   -   5. In one example, the weighted sample prediction process of BCW        may depend on a different weight look up table.

a. In one example, {4, 5, 3, 10, 2}/{4, 3, 5, 10, 2}/{4, 5, 3, 10,1},/3, 5, 10, 1}/{4, 5, 3, 10, −1} may be used as the weight look uptable of BCW.

-   -   6. In one example, in the weighted sample prediction process of        BCW, the intermediate prediction sample in each prediction        direction may be converted (if necessary, e.g., when the first        bit depth is not equal to the bit depth of the intermediate        prediction sample) to a first bit depth, then weighted        prediction may be applied and the final prediction sample may be        converted to a second bit depth.        -   a. In one example, the second bit depth is same with the            input bit depth of the current color component.        -   b. In one example, in conversion between different bit            depth, right shift (e.g., covert a sample from a higher bit            depth to a lower bit depth) or left shift (e.g., covert a            sample from a lower bit depth to a higher bit depth) may be            applied. p'i. Alternatively, furthermore, an offset may be            added before the right shift or left shift.        -   c. In one example, the first bit depth is same with the bit            depth of the intermediate prediction sample. The weighted            sample prediction of BCW may be derived as:            pbSamples[x][y=Clip3(0, (1 <<bitDepth)−1, (w0*            predSamplesL0[x][y+w1*predSamplesL1[x][y+offset3) >>(shift1            +3)), where shift1 is set equal to Max(2, 14-bitDepth), the            variable offset3 is set equal to 1 <<(shiftl+2), and the            bitDepth is a bit depth of a current color component.        -   d. In one example, the first bit depth is same to the input            bit depth of the current color component. The weighted            sample prediction of BCW may be derived as:            pbSamples[x][y=Clip3(0, (1 <<bitDepth)−1, (w0*            ((predSamplesL0[x][y]+offset1)>>shiftl)+w1*((predSamplesL1[x][y            +offset1)>>shiftl)+4) >>3), where shiftl is set equal to            Max(2, 14-bitDepth), the variable offsetl is set equal to 1            <<(shift1−1).

MMVD range

-   -   7. In one example, the merge motion vector difference may be        clipped to the same range as the motion vector.        -   a. In one example, the merge motion vector difference may be            clipped to 18 bits, e.g., [−2¹⁷, 2¹⁷−1], which is the same            as motion vector range in VVC.        -   b. In one example, the merge motion vector difference may be            clipped to [−2¹⁷+1, 2¹⁷−1].        -   c. In one example, the merge motion vector difference may            not be clipped.        -   i. For example, after the merge motion vector difference is            added to the motion vector prediction candidate, the result            of motion vector is clipped to 18 bits.

Signal of the cu_skip_flag

-   -   8. It is proposed that the indication of whether a CU/PU/block        is coded in skip mode (e.g., cu_skip_flag) may be conditionally        signaled, depending on the dimensions of the coding block.        -   a. In one example, the indication (e.g., cu_skip_flag) may            be signaled when the current slice type is I-slice, and the            sps ibc enabled flag is equal to true, and both the block            width and block height are less than or equal to N (N is an            integer). For example, N=64.        -   b. In one example, when the current block is coded in IBC            mode, the indication (e.g., cu_skip_flag) may be signaled            when both the block width and block height are less than or            equal to N (N is an integer). For example, N=64.

Coding Tools on Chroma Components

9. Whether a coding tool X (e.g., X being TMVP/ATMVP/BCW/MMVD/PDPC)could be applied on one block of a first color component may depend onwhether it is applied on one or multiple corresponding blocks in asecond color component.

-   -   a. In one example, the usage of the coding tool X for a first        color component (e.g., chroma) block may be disabled when the        coding tool is applied to the corresponding second color        component (e.g., luma) block.    -   b. In one example, the usage of the coding tool X for a first        color component (e.g., chroma) block may be disabled when a        coding tool Y (wherein Y is different from X) is applied to the        corresponding second color component (e.g., luma) block.    -   c. In one example, a message (such as a flag or an index) may be        conditionally signaled to indicate whether coding tool X is        applied on first color components of a block. The condition may        be defined as whether it is applied on the corresponding second        color component blocks. Alternatively, furthermore, it is not        applied on first components of a block without signaling if it        is not applied on the corresponding second color component        blocks.    -   i. In one example, coding tool X may be applied in a different        manner on different color components.        -   1) It may be signaled how to apply coding tool X on the luma            component and the chroma components separately.    -   d. In one example, the first color component is chroma component        and the second color component is the luma component.    -   e. In one example, the first color component is one chroma color        component and the second color component is another chroma color        component.    -   f. In one example, the first color component is luma color        component and the second color component is a chroma color        component.    -   g. In the above discussion, a “corresponding second color        component block” may refer to a second color component block        which covers at least one “corresponding sample” of the first        color component block.        -   i. In one example, the first color component is chroma            component and the second color component is the luma            component.        -   ii. The sample positions may be scaled according to the            color format such as 4:4:4 or 4:2:0. Suppose the top-left            position of the chroma block is (x0, y0), and the width and            height of the chroma block are W and H, all of which are            scaled to the luma sample unit.        -   iii. In one example, the corresponding sample may be at (x0,            y0);        -   iv. In one example, the corresponding sample may be at            (x0+W−1, y0+H−1);        -   v. In one example, the corresponding sample may be at            (x0+W/2−1, y0+H/2-1);        -   vi. In one example, the corresponding sample may be at            (x0+W/2, yO+H/2);        -   vii. In one example, the corresponding sample may be at            (x0+W/2, yO+H/2-1);        -   viii. In one example, the corresponding sample may be at            (x0+W/2-1, y0+H/2);    -   h. In the above discussion, “chroma components” may refer to        “one or multiple chroma components”.

10. It is proposed that position-dependent intra prediction samplefiltering process (a.k.a. PDPC) may be disabled for some chromacomponents when the co-located luma block of the chroma block is codedin some modes.

-   -   a. In one example, such process may be disabled when the        co-located luma block of the chroma block is coded in MIP        (Matrix-based Intra Prediction) mode.    -   b. In one example, such process may be disabled when the        co-located luma block of the chroma block is coded in MRL        (Multiple Reference Line) mode.

11. Indication of whether an alternative half-pel interpolation filteris used may be set equal to false when a CU/PU/block only has MVcomponent with finer precision (e.g., 1/4-pel, ⅛-pel etc.) thanhalf-pel. That is to say, the default half-pel interpolation filterinstead of the alternative half-pel interpolation filter may be used.

a. In one example, such indication may be set equal to false in MMVDmode if the reconstructed MV only has MV component with finer precisionthan half-pel.

b. In one example, such indication may be set equal to false for apair-wise merge candidate if it only has MV component with finerprecision than half-pel.

c. In one example, such indication may be set equal to false when areconstructed bi-predicted motion information is converted to auni-predicted motion information (e.g., applied on small blocks like 4*8or/and 8*4 blocks) which only has MV component with finer precision thanhalf-pel.

12. Indication of whether an alternative half-pel interpolation filteris used may be always set equal to false in some cases. That is to say,the default half-pel interpolation filter may be always used in thesecases.

-   -   a. In one example, such indication may be always set equal to        false in MMVD mode.    -   b. In one example, such indication may be always set equal to        false in MMVD mode when some specific MVDs are selected.        -   i. For example, if an MVD with ¼-pel precision is selected,            such indication may be set equal to false.    -   c. In one example, such indication may be always set equal to        false for pair-wise merge candidates.    -   d. In one example, such indication may be always set equal to        false when a reconstructed bi-predicted motion information is        converted to a uni-predicted motion information (e.g., applied        on small blocks like 4*8 or/and 8*4 blocks).

General Solutions

13. Whether to and/or how to apply the disclosed methods above may besignaled at sequence level/picture level/slice level/tile group level,such as in sequence header/picture header/SPS/VPS/DPS/PPS/APS/sliceheader/tile group header.

The examples described above may be incorporated in the context of themethods described below, e.g., methods 800, 900, 1000, 1100, 1200 and1300, which may be implemented at a video decoder or a video encoder.

FIG. 8 shows a flowchart of an exemplary method for video processing.The method 800 includes, at step 810, determining an availability of oneor more collocated motion vectors based on a prediction mode of acollocated video block relative to a current video block.

The method 800 includes, at step 820, performing, based on the one ormore collocated motion vectors, a conversion between the current blockand a bitstream representation of the current block, an indication ofthe prediction mode comprising one bit that indicates whether thecurrent video block is coded with an inter mode or a non-inter mode.

FIG. 9 shows a flowchart of an exemplary method for video processing.The method 800 includes, at step 910, determining, for a conversionbetween a coded representation of a video block and the video block, atype of a collocated video block of the video block, the type taking oneof only two possible values.

The method 800 includes, at step 920, performing the conversion based onthe determining.

FIG. 10 shows a flowchart of an exemplary method for video processing.The method 800 includes, at step 1010, deriving, based on a first weighttable associated with a bi-prediction mode with a coding unit (CU)-levelweight (BCW) process, a prediction sample for a current block, the firstweight table being asymmetric.

The method 800 includes, at step 1020, performing, based on theprediction sample, a conversion between the current block and abitstream representation of the current block.

FIG. 11 shows a flowchart of an exemplary method for video processing.The method 800 includes, at step 1110, making a decision, based on adimension of the current video block, regarding a selective signaling ofan indication of a skip mode coding of the current video block in abitstream representation of the current video block.

The method 800 includes, at step 1120, performing, based on thedecision, a conversion between the current block and the bitstreamrepresentation of the current block.

FIG. 12 shows a flowchart of an exemplary method for video processing.The method 800 includes, at step 1210, making a decision, based on anapplication of a first coding tool to one or more blocks in a firstcolor component of a current video block, regarding a selectiveapplication of a second coding tool to at least one block of a secondcolor component of the current video block.

The method 800 includes, at step 1220, performing, based on thedecision, a conversion between the current block and the bitstreamrepresentation of the current block.

FIG. 13 shows a flowchart of an exemplary method for video processing.The method 800 includes, at step 1310, making a decision, based on aprecision of a motion vector in a current video block, regarding aselective signaling of an indication for using an alternative half-pelinterpolation filter instead of a default half-pel interpolation filter.

The method 800 includes, at step 1320, performing, based on thedecision, a conversion between the current block and the bitstreamrepresentation of the current block.

Some embodiments of the disclosed technology include making a decisionor determination to enable a video processing tool or mode. In anexample, when the video processing tool or mode is enabled, the encoderwill use or implement the tool or mode in the processing of a block ofvideo, but may not necessarily modify the resulting bitstream based onthe usage of the tool or mode. That is, a conversion from the block ofvideo to the bitstream representation of the video will use the videoprocessing tool or mode when it is enabled based on the decision ordetermination. In another example, when the video processing tool ormode is enabled, the decoder will process the bitstream with theknowledge that the bitstream has been modified based on the videoprocessing tool or mode. That is, a conversion from the bitstreamrepresentation of the video to the block of video will be performedusing the video processing tool or mode that was enabled based on thedecision or determination.

Some embodiments of the disclosed technology include making a decisionor determination to disable a video processing tool or mode. In anexample, when the video processing tool or mode is disabled, the encoderwill not use the tool or mode in the conversion of the block of video tothe bitstream representation of the video. In another example, when thevideo processing tool or mode is disabled, the decoder will process thebitstream with the knowledge that the bitstream has not been modifiedusing the video processing tool or mode that was disabled based on thedecision or determination.

In the present document, the term “video processing” may refer to videoencoding, video decoding, video compression or video decompression. Forexample, video compression algorithms may be applied during conversionfrom pixel representation of a video to a corresponding bitstreamrepresentation or vice versa. The bitstream representation of a currentvideo block may, for example, correspond to bits that are eitherco-located or spread in different places within the bitstream, as isdefined by the syntax. For example, a macroblock may be encoded in termsof transformed and coded error residual values and also using bits inheaders and other fields in the bitstream.

5. Exemplary Embodiments of the Disclosed Technology

The changes are highlighted in bold and Italic. Deleted texts are markedwith double brackets (e.g., [[a]] denotes the deletion of the character“a”).

5.1 Embodiment #1

The working draft specified in JVET-02001-vE may be changed as below.

8.5.2.12 Derivation Process for Collocated Motion Vectors

The variables mvLXCol and availableFlagLXCol are derived as follows:

If colCb is coded in an intra or palette or IBC prediction mode, bothcomponents of mvLXCol are set equal to 0 and availableFlagLXCol is setequal to 0.

Otherwise, the motion vector mvCol, the reference index refldxCol andthe reference list identifier listCol are derived as follows:

Alternatively, the following may apply: The variables mvLXCol andavailableFlagLXCol are derived as follows:

If colCb is not coded in an [[intra or IBC]] inter prediction mode, bothcomponents of mvLXCol are set equal to 0 and availableFlagLXCol is setequal to 0.

Otherwise, the motion vector mvCol, the reference index refldxCol andthe reference list identifier listCol are derived as follows:

5.2 Embodiment #2

The working draft specified in JVET-02001-vE may be changed as below.

8.5.1 General Decoding Process for Coding Units Coded in InterPrediction Mode 3. The arrays of luma and chroma motion vectors afterdecoder side motion vector refinement, refMvLX[xSbIdx][ySbIdx]andrefMvCLX[xSbIdx][ySbIdx], with X being 0 and 1, are derived as followsfor xSbIdx=0 . . . numSbX 1, ySbIdx =0. . . numSbY−1:

If dmvrFlag is equal to 1, the derivation process for chroma motionvectors in clause 8.5.2.13 is invoked with refMvLX[ xSbIdx ][ ySbIdx ]and refldxLX as inputs, and refMvCLX[ xSbldx ][ ySbIdx ] as output andthe input refMvLX[ xSbldx ][ ySbIdx ] is derived as follows;

$\begin{matrix}{{{{refMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack} = {{{{mvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack} + {{{dMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack}}} & \left( {8\text{-}287} \right) \\{{{{{refMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdxx}\rbrack}\lbrack 0\rbrack} = {{Clip}\; 3\left( {{- 2^{17}},{2^{17} - 1},{{{{refMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack}\lbrack 0\rbrack}} \right)}} & \left( {8\text{-}288} \right) \\{{{{{refMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdxx}\rbrack}\lbrack 1\rbrack} = {{Clip}\; 3\left( {{- 2^{17}},{2^{17} - 1},{{{{refMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack}\lbrack 1\rbrack}} \right)}} & \left( {8\text{-}289} \right)\end{matrix}$

Otherwise (dmvrFlag is equal to 0), the following applies:

$\begin{matrix}{{{{refMvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack} = {{{mvLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack}} & \left( {8\text{-}290} \right) \\{{{{refMvCLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack} = {{{mvCLX}\lbrack{xSbIdx}\rbrack}\lbrack{ySbIdx}\rbrack}} & \left( {8\text{-}291} \right)\end{matrix}$

NOTE—The array refMvLX is stored in MvDmvrLX and used in the derivationprocess for collocated motion vectors in clause 8.5.2.12. After decodinga slice, MvDmvrLX[xSbldx][ySbldx] and the corresponding referenceindices are all set equal to −1 when the coding block Cb[xSbldx][ySbldx]is coded in an IBC prediction mode. The array of non-refine luma motionvectors MvLX is used in the spatial motion vector prediction anddeblocking boundary strength derivation processes.

8.5.2.12 Derivation Process for Collocated Motion Vectors

The variables mvLXCol and availableFlagLXCol are derived as follows:

-   -   If colCb is coded in an intra or IBC prediction mode, both        components of mvLXCol are set equal to 0 and availableFlagLXCol        is set equal to 0.    -   Otherwise, the motion vector mvCol, the reference index        refldxCol and the reference list identifier listCol are derived        as follows:        If predFlagLOCol[xColCb][yColCb] is equal to 0 and        predFlagL1Col[xColCb][yColCb] is equal to 0, both components of        mvLXCol are set equal to 0 and availableFlagLXCol is set equal        to 0.

Otherwise, the following applies:

-   -   If sbFlag is equal to 0, availableFlagLXCol is set to 1 and the        following applies:    -   If predFlagL0Col[xColCb][yColCb] is equal to 0, mvCol, refldxCol        and listCol are set equal to mvL1Col[xColCb][yColCb],        refIdxL1Col[xColCb][yColCb] and L1, respectively.    -   Otherwise, if predFlagL0Col[xColCb][yColCb] is equal to 1 and        predFlagL1Col[xColCb][yColCb] is equal to 0, mvCol, refldxCol        and listCol are set equal to mvLOCol[xColCb][yColCb],        refldxLOCol[ xColCb][yColCb] and L0, respectively.    -   Otherwise (predFlagLOCol[ xColCb ][ yColCb ] is equal to 1 and        predFlagL1Col[ xColCb ][ yColCb ] is equal to 1), the following        assignments are made:        -   If NoBackwardPredFlag is equal to 1, mvCol, refldxCol and            listCol are set equal to mvLXCol[ xColCb ][ yColCb ],            refldxLXCol[xColCb][yColCb] and LX, respectively.    -   Otherwise, mvCol, refldxCol and listCol are set equal to        mvLNCol[xColCb][yColCb], refldxLNCol[xColCb][yColCb] and LN,        respectively, with N being the value of collocated from 10 flag.    -   Otherwise (sbFlag is equal to 1), the following applies:    -   If PredFlagLXCol[ xColCb][yColCb] is equal to 1, mvCol,        refldxCol, and listCol are set equal to mvLXCol[        xColCb][yColCb], refldxLXCol[xColCb][yColCb], and LX,        respectively, availableFlagLXCol is set to 1.    -   Otherwise (PredFlagLXCol[xColCb][yColCb] is equal to 0), the        following applies:    -   If NoBackwardPredFlag is equal to 1 and        PredFlagLYCol[xColCb][yColCb] is equal to 1, mvCol, refldxCol,        and listCol are set to mvLYCol[xColCb][yColCb],        refldxLYCol[xColCb][yColCb] and LY, respectively, with Y being        equal to !X where X being the value of X this process is invoked        for. availableFlagLXCol is set equal to 1.    -   Otherwise, both components of mvLXCol are set equal to 0 and        availableFlagLXCol is set equal to 0.

5.3 Embodiment #3

The working draft specified in JVET-02001-vE may be changed as below.

8.5.6.6.2 Default Weighted Sample Prediction Process

Variables shift1, shift2, offset1, offset2, and offset3 are derived asfollows:

-   -   The variable shift1 is set equal to Max(2, 14—bitDepth) and the        variable shift2 is set equal to Max(3, 15—bitDepth).

The variable offset1 is set equal to 1<<(shift1−1).

The variable offset2 is set equal to 1<<(shift2−1).

The variable offset3 is set equal to 1<<(shift2+/[[2]]).

Otherwise (predFlagLO is equal to 1 and predFlagL1 is equal to 1), thefollowing applies:

If bcwldx is equal to 0 or ciip_flag[ xCb ][ yCb] is equal to 1, theprediction sample values are derived as follows:

$\begin{matrix}{{{{pbSamples}\lbrack\; x\;\rbrack}\lbrack\; y\;\rbrack} = {{Clip}\; 3\left( {0,{\left( {1 ⪡ {bitDepth}} \right) - 1},} \right.}} & \left( {8\text{-}823} \right)\end{matrix}$

(predSamplesL0; [x][y]+predSamplesL1[x][y] +offset2)>>shift2)

Otherwise (bcwldx is not equal to 0 and ciip_flag[ xCb ][yCb] is equalto 0), the following applies:

-   -   The variable wl is set equal to bcwWLut[ bcwldx ] with bcwWLut[        k ] =4, 5, 3, 10, 2 I.    -   The variable w0 is set equal to (8−w1).    -   The prediction sample values are derived as follows.

$\begin{matrix}{{{{pbSamples}\lbrack x\rbrack}\lbrack y\rbrack} = {{Clip}\; 3\left( {0,{\left( {1 ⪡ {bitDepth}} \right) - 1},} \right.}} & \left( {8\text{-}824} \right)\end{matrix}$

(w0*predSamplesL0[x][y]+w1*predSamplesL1[x][y]+offset3)>>(shift2+[[3]]2))

Alternatively, the following may apply:

Variables shift1, shift2, offset1, offset2, and offset3 are derived asfollows:

The variable shift1 is set equal to Max(2, 14−bitDepth) [[and thevariable shift2 is set equal to

Max(3, 15−bitDepth)]].

The variable offset1 is set equal to 1<<(shift1−1).

The variable offset2 is set equal to 1<<(shift/+[[2−ϕ1). The variableoffset3 is set equal to 1<<(shift[[2]]I/ +2).

Otherwise (predFlagL0 is equal to 1 and predFlagL1 is equal to 1), thefollowing applies:

If bcwldx is equal to 0 or ciip_flag[xCb][yCb] is equal to 1, theprediction sample values are derived as follows:

$\begin{matrix}{{{{pbSamples}\lbrack\; x\;\rbrack}\lbrack\; y\;\rbrack} = {{Clip}\; 3\left( {0,{\left( {1 ⪡ {bitDepth}} \right) - 1},} \right.}} & \left( {8\text{-}823} \right)\end{matrix}$

(predSamplesL0[x][y]+predSamplesL1[x][y]+offset2)>>(shift1+1)[[2]])

Otherwise (bcwldx is not equal to 0 and ciip_flag[xCb][yCb] is equal to0), the following applies:

-   -   The variable w1 is set equal to bcwWLut[ bcwldx ] with bcwWLut[        k ] =4, 5, 3, 10, −2}.    -   The variable w0 is set equal to (8−w1).    -   The prediction sample values are derived as follows.

$\begin{matrix}{{{{pbSamples}\lbrack x\rbrack}\lbrack y\rbrack} = {{Clip}\; 3\left( {0,{\left( {1 ⪡ {bitDepth}} \right) - 1},} \right.}} & \left( {8\text{-}824} \right)\end{matrix}$

(w0*predSamplesL0[x][y] +w1*predSamplesL1[x] [y]+offset3)>>(shift/+3[[2+3]1))

Alternatively, the following may apply:

Variables shift1, shift2, offset1, offset2, and offset3 are derived asfollows:

The variable shift1 is set equal to Max(2, 14−bitDepth) and the variableshift2 is set equal to Max(3, 15−bitDepth).

The variable offset1 is set equal to 1<<(shift1−1).

The variable offset2 is set equal to 1<<(shift2−1).

[[The variable offset3 is set equal to 1<<(shift2+2).]]

Otherwise (predFlagL0 is equal to 1 and predFlagL1 is equal to 1), thefollowing applies:

If bcwldx is equal to 0 or ciip_flag[xCb][yCb] is equal to 1, theprediction sample values are derived as follows:

$\begin{matrix}{{{{pbSamples}\lbrack\; x\;\rbrack}\lbrack\; y\;\rbrack} = {{Clip}\; 3\left( {0,{\left( {1 ⪡ {bitDepth}} \right) - 1},} \right.}} & \left( {8\text{-}823} \right)\end{matrix}$

(predSamplesL0[x][y+predSamplesLl[x][y]+offset2) >>shift2)

Otherwise (bcwldx is not equal to 0 and ciipflag[xCb][yCb] is equal to0), the following applies:

The variable w1 is set equal to bcwWLut[bcwldx] with bcwWLut[k]=4, 5, 3,10, −2}.

The variable w0 is set equal to (8−w1).

The prediction sample values are derived as follows.

$\begin{matrix}{{{{pbSamples}\lbrack x\rbrack}\lbrack y\rbrack} = {{Clip}\; 3\left( {0,{\left( {1 ⪡ {bitDepth}} \right) - 1},} \right.}} & \left( {8\text{-}824} \right)\end{matrix}$

w0*((predSamplesLO[ x ][ y ] +offset1)>>shift1) +w1*((predSamplesLl[ x][ y ] +offset1)>>shift1)+4)>>(8[[shift2+3)]])

5.4 Embodiment #4

The working draft specified in JVET-02001-vE may be changed as below.

8.5.6.6.2 Default weighted sample prediction process

Otherwise (bcwIdx is not equal to 0 and ciip flag[ xCb ][ yCb ] is equalto 0), the following applies:

The variable w1 is set equal to bcwWLut[ bcwIdx ] with bcwWLut[k={ 4,5,3, 10,2[[-2]]1/(4,5,3,10,1)44,3,5,10,2)1(4,3,5,10,1)44,5,3,10,-1).

5.5 Embodiment #5

The working draft specified in JVET-02001-vE may be changed as below.

8.5.2.7 Derivation process for merge motion vector difference mMvdL1[0=Clip3(−2¹¹¹⁵¹¹¹⁷, 2¹¹¹⁵¹¹¹⁷-1, (distScaleFactor*mMvdLO[0+(8-394)128−(distScaleFactor*mMvdLO[0]>=0))>>8) mMvdL1[1=Clip3(−2«¹⁵»¹′2¹¹¹⁵¹¹¹⁷-1, (distScaleFactor * mMvdLO[1+(8-395)128-(distScaleFactor*mMvdLO[1]>=0)) >>8) mMvdLO[0=Clip3(−2«¹⁵»¹′2¹¹¹⁵¹¹′⁷-1, (distScaleFactor*mMvdL1[0+(8-404)128-(distScaleFactor*mMvdL1[0]>=0)) >>8) mMvdLO[1=Clip3(−2«¹⁵»¹′2¹¹¹⁵¹¹′⁷-1-(distScaleFactor*mMvdL1[1+(8-405) 128-(distScaleFacto*mMvdL1[]22 =0)) >>8)) 5.6 Embodiment #6

The working draft specified in JVET-02001-vE may be changed as below.

7.3.8.5 Coding unit syntax

Descriptor coding_unit( x0, y0, cbWidth, cbHeight, cqtDepth, treeType,modeType ) {  chType = treeType = = DUAL_TREE_CHROMA? 1 : 0  if(slice_type != I | | sps_ibc_enabled_flag[[ | |sps_palette_enabled_flag]]) {   if( treeType != DUAL_TREE_CHROMA &&   !( ( ( cbWidth = = 4 && cbHeight = = 4 ) | | modeType = =MODE_TYPE_INTRA )     && !(sps_ibc_enabled_flag 

 

 ) )     cu_skip_flag[ x0 ][ y0 ] ae(v)   if( cu_skip_flag[ x0 ][ y0 ] == 0 && slice_type != I    && !( cbWidth = = 4 && cbHeight = = 4 ) &&modeType = = MODE_TYPE_ALL )     pred_mode_flag ae(v)   if( ( (slice_type = = I && cu_skip_flag[ x0 ][ y0 ] = =0 ) | |      (slice_type != I && ( CuPredMode[ chType ][ x0 ][ y0 ] != MODE_INTRA | |      ( cbWidth = = 4 && cbHeight = = 4 && cu_skip_flag[ x0 ][ y0 ] = =0 ) ) ) ) &&     cbWidth <= 64 && cbHeight <= 64 && modeType !=MODE_TYPE_INTER &&     sps_ibc_enabled_flag && treeType !=DUAL_TREE_CHROMA )     pred_mode_ibc_flag ae(v)   

  if( ( ( ( slice_type = = I | | ( cbWidth = = 4 && cbHeight = = 4 ) | |sps_ibc_enabled_flag ) &&        CuPredMode[ x0 ][ y0 ] = = MODE_INTRA )| |      ( slice_type != I && !( cbWidth = = 4 && cbHeight = = 4 ) &&!sps_ibc_enabled_flag       && CuPredMode[ x0 ][ y0 ] != MODE_INTRA ) )&& sps_palette_enabled_flag &&      cbWidth <= 64 && cbHeight <= 64 &&&& cu_skip_flag[ x0 ][ y0 ] = = 0 &&      modeType != MODE_INTER )    pred_mode_plt_flag ae(v)  [[}]]

FIG. 14A is a block diagram of a video processing apparatus 1400. Theapparatus 1400 may be used to implement one or more of the methodsdescribed herein. The apparatus 1400 may be embodied in a smartphone,tablet, computer, Internet of Things (IoT) receiver, and so on. Theapparatus 1400 may include one or more processors 1402, one or morememories 1404 and video processing hardware 1406. The processor(s) 1402may be configured to implement one or more methods (including, but notlimited to, methods 800, 900, 1000, 1100, 1200 and 1300) described inthe present document. The memory (memories) 1404 may be used for storingdata and code used for implementing the methods and techniques describedherein. The video processing hardware 1406 may be used to implement, inhardware circuitry, some techniques described in the present document.In some embodiments, the hardware 1406 may be completely or partiallyimplemented in the processor 1402, e.g., a graphics co-processor.

FIG. 14B is a block diagram showing an example video processing system1410 in which various techniques disclosed herein may be implemented.Various implementations may include some or all of the components of thesystem 1410. The system 1410may include input 1412 for receiving videocontent. The video content may be received in a raw or uncompressedformat, e.g., 8 or 10 bit multi-component pixel values, or may be in acompressed or encoded format. The input 1412 may represent a networkinterface, a peripheral bus interface, or a storage interface. Examplesof network interface include wired interfaces such as Ethernet, passiveoptical network (PON), etc. and wireless interfaces such as Wi-Fi orcellular interfaces.

The system 1410 may include a coding component 1414 that may implementthe various coding or encoding methods described in the presentdocument. The coding component 1414 may reduce the average bitrate ofvideo from the input 1412 to the output of the coding component 1414 toproduce a coded representation of the video. The coding techniques aretherefore sometimes called video compression or video transcodingtechniques. The output of the coding component 1414 may be eitherstored, or transmitted via a communication connected, as represented bythe component 1416. The stored or communicated bitstream (or coded)representation of the video received at the input 1412 may be used bythe component 1418 for generating pixel values or displayable video thatis sent to a display interface 1420. The process of generatinguser-viewable video from the bitstream representation is sometimescalled video decompression. Furthermore, while certain video processingoperations are referred to as “coding” operations or tools, it will beappreciated that the coding tools or operations are used at an encoderand corresponding decoding tools or operations that reverse the resultsof the coding will be performed by a decoder.

Examples of a peripheral bus interface or a display interface mayinclude universal serial bus (USB) or high definition multimediainterface (HDMI) or display port, and so on. Examples of storageinterfaces include SATA (serial advanced technology attachment), PCI,IDE interface, and the like. The techniques described in the presentdocument may be embodied in various electronic devices such as mobilephones, laptops, smartphones or other devices that are capable ofperforming digital data processing and/or video display.

In some embodiments, the video coding methods may be implemented usingan apparatus that is implemented on a hardware platform as describedwith respect to FIG. 14A or 14B.

The following listing provides embodiments that can addressed thetechnical problems described in the present document, among otherproblems. The first set of clauses describe certain features and aspectsof the disclosed techniques in the previous section.

1. A method for processing video, comprising: determining anavailability of one or more collocated motion vectors based on aprediction mode of a collocated video block relative to a current videoblock; and performing, based on the one or more collocated motionvectors, a conversion between the current block and a bitstreamrepresentation of the current block, wherein an indication of theprediction mode comprises one bit that indicates whether the currentvideo block is coded with an inter mode or a non-inter mode.

2. A method for processing video, comprising: determining, for aconversion between a coded representation of a video block and the videoblock, a type of a collocated video block of the video block, whereinthe type takes one of only two possible values; and performing theconversion based on the determining.

3. The method of clause 1, wherein the two possible values include afirst value indicating that the collocated video block is inter-codedand a second value that indicates that the collocated video block iscoded using a mode other than inter-coded.

4. The method of any of clauses 1 to 3, wherein the determining isidentical when the current video block is coded with palette predictionmode and when the current video block is coded with an intra or intrablock copy (IBC) prediction mode.

5. The method of any of clauses 1 to 3, wherein the one or morecollocated motion vectors is determined to be unavailable when thecollocated video block is coded with a non-inter prediction mode.

6. The method of any of clauses 1 to 3, wherein the one or morecollocated motion vectors is determined to be available and comprises adefault motion vector when the collocated video block is coded with anon-inter prediction mode.

7. The method of clause 5 or 6, wherein the non-inter prediction mode isan intra prediction mode, a palette prediction mode or an intra blockcopy (IBC) prediction mode.

8. The method of any of clauses 1 to 3, wherein the determining is basedon a reference index or a reference list of the collocated video block.

9. The method of clause 8, wherein the reference index is apredetermined value.

10. The method of clause 8, wherein the reference index excludes apredetermined value.

11. The method of clause 9 or 10, wherein the predetermined value is 0.

12. A method for video processing, comprising: deriving, based on afirst weight table associated with a bi-prediction mode with a codingunit (CU)-level weight (BCW) process, a prediction sample for a currentblock, wherein the first weight table is asymmetric; and performing,based on the prediction sample, a conversion between the current blockand a bitstream representation of the current block.

13. The method of clause 12, wherein entries in the first weight tableare non-monotonically increasing.

14. The method of clause 12, wherein the BCW process is further based ona second weight table different from the first weight table.

15. The method of clause 12, wherein deriving the prediction samplecomprises: converting an intermediate prediction sample to a first bitdepth; applying a weight from the first weight table to the intermediateprediction sample to derive the prediction sample; and converting theprediction sample to a second bit depth.

16. The method of clause 15, wherein the second bit depth is a bit depthof a color component of the current video block.

17. A method for video processing, comprising: making a decision, basedon a dimension of the current video block, regarding a selectivesignaling of an indication of a skip mode coding of the current videoblock in a bitstream representation of the current video block; andperforming, based on the decision, a conversion between the currentblock and the bitstream representation of the current block.

18. The method of clause 17, wherein the indication is signaled upon adetermination that a slice type of a slice comprising the current videoblock is an I-slice, an sps ibc enabled flag is set to true, and aheight and a width of the current video block are less than or equal toN.

19. The method of clause 17, wherein the indication is signaled upon adetermination that the current video block is coded with an intra blockcopy (IBC) mode and a height and a width of the current video block areless than or equal to N.

20. The method of clause 18 or 19, wherein N=64.

21. A method for video processing, comprising: making a decision, basedon an application of a first coding tool to one or more blocks in afirst color component of a current video block, regarding a selectiveapplication of a second coding tool to at least one block of a secondcolor component of the current video block; and performing, based on thedecision, a conversion between the current block and the bitstreamrepresentation of the current block.

22. The method of clause 21, wherein the second coding tool is appliedupon a determination that the second coding tool is identical to thefirst coding tool.

23. The method of clause 21, wherein the second coding tool is notapplied upon a determination that the second coding tool is differentfrom the first coding tool.

24. The method of clause 21, wherein the decision is further based on anindication in the bitstream representation.

25. The method of any of clauses 21 to 24, wherein the first colorcomponent is a luma component and the second color component is a chromacomponent.

26. The method of any of clauses 21 to 24, wherein the first colorcomponent is a first chroma color component and the second colorcomponent is a second chroma color component.

27. The method of any of clauses 21 to 26, wherein the first coding tooland the second coding tool are one of temporal motion vector prediction(TMVP), alternative temporal motion vector prediction (ATMVP), abi-prediction with a coding unit (CU)-level weight (BCW) process, amerge mode with motion vector differences (MMVD) or a position-dependentprediction combination (PDPC) process.

28. A method for video processing, comprising: making a decision, basedon a precision of a motion vector in a current video block, regarding aselective signaling of an indication for using an alternative half-pelinterpolation filter instead of a default half-pel interpolation filter;and performing, based on the decision, a conversion between the currentblock and the bitstream representation of the current block.

29. The method of clause 28, wherein the default half-pel interpolationfilter is used upon a determination that the current video block iscoded with a merge mode with motion vector differences (MMVD) and aprecision of a reconstructed motion vector is lower than half-pel.

30. The method of any of clauses 1 to 29, wherein performing theconversion is further based on signaling in a decoder parameter set(DPS), a sequence parameter set (SPS), a picture parameter set (PPS), anadaptive parameter set (APS), a video parameter set (VPS), a sequenceheader, a picture header, a slice header, or a tile group header.

31. The method of any of clauses 1 to 30, wherein performing theconversion comprises generating the bitstream representation from thecurrent video block.

32. The method of any of clauses 1 to 30, wherein performing theconversion comprises generating the current video block from thebitstream representation.

33. A video decoding apparatus comprising a processor configured toimplement a method recited in any one of clauses 1 to 32.

34. A computer program product stored on a non-transitory computerreadable media, the computer program product including program code forcarrying out the method in any one of clauses 1 to 32.

The second set of clauses describe certain features and aspects of thedisclosed techniques in the previous section (e.g., items 1 and 2).

1. A method of video processing, comprising: making a firstdetermination about whether a collocated video block of a video block ofa video is coded using an inter coding mode or a non-inter coding mode;making a second determination, based on the first determination, aboutavailability of motion vectors of the collocated video block or a modeof derivation of motion vectors for the collocated video block; andperforming a conversion between the video block and a codedrepresentation of the video based on the second determination.

2. The method of clause 1, wherein the non-inter coding mode is an intramode, a palette mode, or an intra block copy (IBC) mode.

3. The method of clause 1, wherein the making of the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with a palette mode andfor the collocated video block coded with an intra mode.

4. The method of clause 1, wherein the making of the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with a palette mode andfor the collocated video block coded with an intra block copy mode.

5. The method of clause 1, wherein the making of the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with an intra mode andfor the collocated video block coded with an intra block copy mode.

6. The method of clause 1, wherein the making a first determinationcomprises: generating one bit to indicate whether the collocated videoblock is coded using the inter coding mode or the non-inter coding mode.

7. The method of clause 1, wherein the making of the seconddetermination determines motion vectors of the collocated video block tobe unavailable based on the first determination that the collocatedvideo block is coded using the non-inter coding mode.

8. The method of clause 1, wherein the making of the seconddetermination determines motion vectors of the collocated video block tobe available based on the first determination that the collocated videoblock is coded using the non-inter coding mode, and wherein a defaultmotion vector is assigned as the motion vectors of the collocated videoblock.

9. The method of clause 1, wherein another video block instead of thecollocated video block is checked in case that the collocated videoblock is coded using the non-inter coding mode.

10. The method of clause 9, wherein the another video block is aneighboring block that is a nearest inter coded block that is left,right, above, or below the collocated video block.

11. A method for processing video, comprising: determining, for aconversion between a video block of a video and a coded representationof the video, one or more collocated motion vectors based on a referenceindex or a reference list of a collocated video block of the videoblock; and performing the conversion based on the determining.

12. The method of clause 11, wherein the one or more collocated motionvectors are derived in case that the reference index of the referencelist of the collocated video block is not equal to a predeterminedvalue.

13. The method of clause 11, wherein the one or more collocated motionvectors are derived in case that the reference index of the referencelist of the collocated video block is equal to a predetermined value.

14. The method of clause 12 or 13, wherein the predetermined value is 0.

15. The method of clause 11, wherein in case that the collocated videoblock is coded in a non-inter coding mode or a reference picture of thecollocated video block does not satisfy a given condition, the one ormore collocated motion vectors are set to be unavailable.

16. The method of clause 11, wherein in case that the collocated videoblock is coded in a non-inter coding mode or a reference picture of thecollocated video block does not satisfy a given condition, the one ormore collocated motion vectors are set to a default value.

17. The method of any of clauses 1 to 16, wherein the conversionincludes encoding the video into the coded representation.

18. The method of any of clauses 1 to 16, wherein the conversionincludes decoding the coded representation to generate the video.

19. A video processing apparatus comprising a processor configured toimplement a method recited in any one or more of clauses 1 to 16.

20. A computer readable medium storing program code that, when executed,causes a processor to implement a method recited in any one or more ofclauses 1 to 16.

21. A computer readable medium that stores a coded representation or abitstream representation generated according to any of the abovedescribed methods.

The third set of clauses describe certain features and aspects of thedisclosed techniques in the previous section (e.g., items 3 to 7).

1. A method of video processing (e.g., method 1530 shown in FIG. 15C),comprising: deriving (1532), for a conversion between a current block ofa video and a coded representation of the video, a prediction block forthe current block that is determined according to a bi-directionalcoding unit level weighting (BCW) tool in which weights are used todetermine a weighted sum of two initial prediction blocks used todetermine the prediction block; and performing (1534) the conversionusing the prediction block, wherein the deriving of the prediction blockcomprises: applying the weights to two intermediate prediction samplesthat respectively belong to the two initial prediction blocks to derivea final prediction sample; and performing a right shift operation forthe final prediction sample to convert a bit depth of the finalprediction sample, wherein the right shift operation ispbSample>>(shift1+3)), wherein pbSample represents the final predictionsample, shiftl is set equal to Max(2, 14−bitDepth); and determining theprediction block based on the final prediction sample.

2. The method of clause 1, wherein, before the performing the rightshift operation, an offset is added to the final prediction sample.

3. The method of clause 1, wherein, the offset is 1 <<(shift1+2).

4. The method of clause3, wherein the final prediction sample,pbSamples[ x ][ y ], is derived such that pbSamples[x][y]=Clip3(0, (1<<bitDepth)−1, (w0 *predSamplesL0[x][y+w1*predSamplesL1[x][y]+offset3) >>(shift1+3)),wherein w0 and wl are the weights, and predSamplesLO[x][y]andpredSamplesL1[x][y] are the two intermediate prediction samples.

5. The method of clause 1, wherein at least one of the weights belongsto a weight table, wherein entries of the weight table arenon-monotonically increasing.

6. A method of video processing, comprising: deriving, for a conversionbetween a current block of a video and a coded representation of thevideo, a prediction block for the current block that is determinedaccording to a bi-directional coding unit level weighting (BCW) tool inwhich weights are used to determine a weighted sum of two initialprediction blocks used to determine the prediction block; and performingthe conversion using the prediction block, wherein the deriving of theprediction block comprises: applying the weights to two intermediateprediction sample that respectively belong to the two initial predictionblocks to derive a final prediction sample; and adding an offset to thefinal prediction sample, wherein the offset is 1 <<(shift1+2), whereinshiftl is set equal to Max(2, 14-bitDepth); and determining theprediction block based on the final prediction sample.

7. The method of clause 6, wherein the determining the prediction blockbased on the final prediction sample comprises: performing a right shiftoperation for the final prediction sample to convert a bit depth of thefinal prediction sample.

8. The method of clause 1 or 7, wherein the right shift operation ispbSample>>(shift1+3)), wherein pbSample represents the final predictionsample.

9. The method of clause 8, wherein the final prediction sample,pbSamples[x][y ], is derived such that pbSamples[x][y]=Clip3(0, (1<<bitDepth)−1, (w0*predSamplesL0[x][y+w1*predSamplesL1[x][y]+offset3) >>(shift1+3)),wherein wherein w0 and w1 are the weights, and predSamplesLO[x][y]andpredSamplesLl[x][y] are the two intermediate prediction samples.

10. The method of clause 6, wherein at least one of the weights belongsto a weight table, wherein entries of the weight table arenon-monotonically increasing.

11. A method of video processing (e.g., method 1540 shown in FIG. 15D),comprising: deriving (1542), for a conversion between a current block ofa video and a coded representation of the video, a motion vectordifference for a merge mode motion vector predictor for the currentblock according to a rule; and performing (1544) the conversion based onthe deriving, wherein the rule specifies whether to clip the motionvector difference to a same range as a range used for clipping motionvectors.

12. The method of clause 11, wherein the rule specifies that the motionvector difference is clipped to the same range as the range used forclipping motion vectors.

13. The method of clause 11, wherein the range used for clipping motionvectors is 18 bits.

14. The method of clause 13, wherein the range used for clipping motionvectors is [−2¹⁷, 2¹⁷−1].

15. The method of clause 11, wherein the rule specifies that the motionvector difference is clipped to [−2 ¹⁷+1, 2 ¹⁷−1].

16. The method of clause 11, wherein the rule specifies not to clip themotion vector difference.

17. The method of clause 16, wherein the rule specifies to clip a resultobtained by adding the motion vector difference to a motion vectorprediction candidate to 18 bits.

18. A method of video processing, comprising: deriving, for a conversionbetween a current block of a video and a coded representation of thevideo, a prediction block for the current block that is determinedaccording to a bi-directional coding unit level weighting (BCW) tool inwhich weights are used to determine a weighted sum of two initialprediction blocks used to determine the prediction block, wherein atleast one of the weights belongs to a weight table, wherein the weighttable is organized according to a rule; and performing the conversionusing the prediction block, wherein the rule specifies that entries ofthe weight table are non-monotonically increasing.

19. The method of clause 18, wherein the weight table includes an(i+1)th entry whose value is smaller than that of i-th entry.

20. A method of video processing, comprising: deriving, for a conversionbetween a current block of a video and a coded representation of thevideo, a prediction block for the current block that is determinedaccording to a bi-directional coding unit level weighting (BCW) tool inwhich weights are used to determine a weighted sum of two initialprediction blocks used to determine the prediction block, wherein atleast one of the weights belongs to a weight table, and the weight tableis selected from multiple weight tables; and performing the conversionusing the prediction block.

21. The method of clause 20, wherein the multiple weight tables include{4, 5, 3, 10, 2}, {4, 3, 5, 10, 2}, {4, 5, 3, 10, 1}, {4, 3, 5, 10, 1},or {4, 5, 3, 10, −1}. 22. A method of video processing, comprising:deriving, for a conversion between a current block of a video and acoded representation of the video, a prediction block for the currentblock that is determined according to a bi-directional coding unit levelweighting (BCW) tool in which weights are used to determine a weightedsum of two initial prediction blocks used to determine the predictionblock; and performing the conversion using the prediction block, whereinthe deriving of the prediction block comprises: converting anintermediate prediction sample to a first bit depth; applying theweights to the intermediate prediction sample to derive a finalprediction sample; and converting the final prediction sample to asecond bit depth.

23. The method of clause 22, wherein the second bit depth is a bit depthof a color component of the current block.

24. The method of clause 22, wherein the first bit depth is not equal toa bit depth of the intermediate prediction sample.

25. The method of clause 22, wherein the deriving of the predictionblock comprises a right shift operation that converts a sample from ahigher bit depth to a lower bit depth or left shift operation thatconverts the sample from the lower bit depth to the higher bit depth.

26. The method of clause 25, wherein an offset is added before the rightshift operation or the left shift operation.

27. The method of clause 22, wherein the final prediction sample,pbSamples[x][y], is derived such that pbSamples[x][y=Clip3(0, (1<<bitDepth)−1, (w0* ((predSamplesLO[x][y]+offset1)>>shift1)+w1*((predSamplesL1[x][y+offset1) >>shiftl) +4)>>3), where w0and w1 are the weights, shiftl is set equal to Max(2, 14−bitDepth) andoffsetl is set equal to 1<<(shift1−1).

28. A method of video processing (method 1550 shown in FIG. 15E),comprising: deriving (1552), for a conversion between a current block ofa video and a coded representation of the video, a prediction block forthe current block that is determined according to a bi-directionalcoding unit level weighting (BCW) tool in which a first weight and asecond weight are used to determine a weighted sum of two initialprediction blocks used to determine the prediction block, wherein atleast one of the first weight and the second weight is included in aweight table, wherein the weight table is organized according to a rule;and performing the conversion using the prediction block, wherein therule specifies that the weight table is asymmetric.

29. The method of clause 28, wherein the weight table includes an entrywhose value corresponds to the first weight, W, and does not include anyentry whose value corresponds to the second weight, (1-W), whereby W isin the range of [a, b] and a sum of a and b, (a+b), is equal to 1.

30. The method of clause 28, wherein the weight table includes an entrywhose value corresponds to the first weight, W, and does not include anyentry whose value corresponds to the second weight, (2N-W), in case thata prediction sample is generated by (WO*P0+W1*P1)>>N, whereby WO and W1are the first weight and the second weight applied to the initial twoprediction blocks PO and P1, respectively; and (W0+W1) is equal to(1<<N).

31. The method of any of clauses 1 to 30, wherein the performing of theconversion includes generating the coded representation from the currentvideo block.

32. The method of any of clauses 1 to 30, wherein the performing of theconversion includes generating the current video block from the codedrepresentation.

33. A video processing apparatus comprising a processor configured toimplement a method recited in any one or more of clauses 1 to 32.

34. A computer readable medium storing program code that, when executed,causes a processor to implement a method recited in any one or more ofclauses 1 to 32.

35. A computer readable medium that stores a coded representation or abitstream representation generated according to any of the abovedescribed methods.

From the foregoing, it will be appreciated that specific embodiments ofthe presently disclosed technology have been described herein forpurposes of illustration, but that various modifications may be madewithout deviating from the scope of the invention. Accordingly, thepresently disclosed technology is not limited except as by the appendedclaims.

Implementations of the subject matter and the functional operationsdescribed in this patent document can be implemented in various systems,digital electronic circuitry, or in computer software, firmware, orhardware, including the structures disclosed in this specification andtheir structural equivalents, or in combinations of one or more of them.Implementations of the subject matter described in this specificationcan be implemented as one or more computer program products, i.e., oneor more modules of computer program instructions encoded on a tangibleand non-transitory computer readable medium for execution by, or tocontrol the operation of, data processing apparatus. The computerreadable medium can be a machine-readable storage device, amachine-readable storage substrate, a memory device, a composition ofmatter effecting a machine-readable propagated signal, or a combinationof one or more of them. The term “data processing unit” or “dataprocessing apparatus” encompasses all apparatus, devices, and machinesfor processing data, including by way of example a programmableprocessor, a computer, or multiple processors or computers. Theapparatus can include, in addition to hardware, code that creates anexecution environment for the computer program in question, e.g., codethat constitutes processor firmware, a protocol stack, a databasemanagement system, an operating system, or a combination of one or moreof them.

A computer program (also known as a program, software, softwareapplication, script, or code) can be written in any form of programminglanguage, including compiled or interpreted languages, and it can bedeployed in any form, including as a stand-alone program or as a module,component, subroutine, or other unit suitable for use in a computingenvironment. A computer program does not necessarily correspond to afile in a file system. A program can be stored in a portion of a filethat holds other programs or data (e.g., one or more scripts stored in amarkup language document), in a single file dedicated to the program inquestion, or in multiple coordinated files (e.g., files that store oneor more modules, sub programs, or portions of code). A computer programcan be deployed to be executed on one computer or on multiple computersthat are located at one site or distributed across multiple sites andinterconnected by a communication network.

The processes and logic flows described in this specification can beperformed by one or more programmable processors executing one or morecomputer programs to perform functions by operating on input data andgenerating output. The processes and logic flows can also be performedby, and apparatus can also be implemented as, special purpose logiccircuitry, e.g., an FPGA (field programmable gate array) or an ASIC(application specific integrated circuit).

Processors suitable for the execution of a computer program include, byway of example, both general and special purpose microprocessors, andany one or more processors of any kind of digital computer. Generally, aprocessor will receive instructions and data from a read only memory ora random access memory or both. The essential elements of a computer area processor for performing instructions and one or more memory devicesfor storing instructions and data. Generally, a computer will alsoinclude, or be operatively coupled to receive data from or transfer datato, or both, one or more mass storage devices for storing data, e.g.,magnetic, magneto optical disks, or optical disks. However, a computerneed not have such devices. Computer readable media suitable for storingcomputer program instructions and data include all forms of nonvolatilememory, media and memory devices, including by way of examplesemiconductor memory devices, e.g., EPROM, EEPROM, and flash memorydevices. The processor and the memory can be supplemented by, orincorporated in, special purpose logic circuitry.

It is intended that the specification, together with the drawings, beconsidered exemplary only, where exemplary means an example. As usedherein, the singular forms “a”, “an” and “the” are intended to includethe plural forms as well, unless the context clearly indicatesotherwise. Additionally, the use of “or” is intended to include“and/or”, unless the context clearly indicates otherwise.

While this patent document contains many specifics, these should not beconstrued as limitations on the scope of any invention or of what may beclaimed, but rather as descriptions of features that may be specific toparticular embodiments of particular inventions. Certain features thatare described in this patent document in the context of separateembodiments can also be implemented in combination in a singleembodiment. Conversely, various features that are described in thecontext of a single embodiment can also be implemented in multipleembodiments separately or in any suitable subcombination. Moreover,although features may be described above as acting in certaincombinations and even initially claimed as such, one or more featuresfrom a claimed combination can in some cases be excised from thecombination, and the claimed combination may be directed to asubcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. Moreover, the separation of various system components in theembodiments described in this patent document should not be understoodas requiring such separation in all embodiments.

Only a few implementations and examples are described and otherimplementations, enhancements and variations can be made based on whatis described and illustrated in this patent document.

What is claimed is:
 1. A method of processing video data, comprising:performing a conversion between a video block of a current picture of avideo and a bitstream of the video based on a prediction mode, whereinin the prediction mode, the video block is divided into at least onesubblock, and motion information of the at least one subblock is derivedbased on motion information of a collocated video block in a collocatedpicture of the current picture, and wherein a position of the collocatedvideo block is derived based on a temporal motion information which isinitialized to a default motion information and is set to specificmotion information related to a specific neighboring block Al which isadjacent to a lower left corner to the video block in response to thespecific neighboring block is available, wherein in the prediction mode,a derivation process for the motion information of the collocated videoblock comprises: making a first determination about whether thecollocated video block is coded with a first coding mode, wherein in thefirst coding mode, reconstructed samples are represented by a set ofrepresentative color values, and the set of representative color valuescomprises at least one of 1) palette predictors, 2) escaped samples, or3) palette information included in the bitstream; and making a seconddetermination, based on the first determination, about an availabilityof motion vectors of the collocated video block and values of motionvectors of the collocated video block, and wherein the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with the first codingmode and for the collocated video block coded with an intra coding modeor a second coding mode, wherein in the second coding mode, predictionsamples are derived from blocks of sample values of same decoded sliceas determined by a block vector.
 2. The method of claim 1, wherein thesecond determination determines the availability of motion vectors ofthe collocated video block to be unavailable in response to the firstdetermination that the collocated video block is coded with the firstcoding mode.
 3. The method of claim 1, wherein the availability ofmotion vectors of the collocated video block coded with the first codingmode is identical for the availability of motion vectors of thecollocated video block coded with the intra coding mode or the secondcoding mode.
 4. The method of claim 2, wherein in response to the firstdetermination that the collocated video block is coded with the firstcoding mode, a flag indicating the availability of motion vectors of thecollocated video block is set to
 0. 5. The method of claim 1, whereinthe second determination determines the values of motion vectors of thecollocated video block coded with the first coding mode to be equal tothe values of motion vectors of the collocated video block coded withthe intra coding mode or the second coding mode.
 6. The method of claim1, wherein in response to the first determination that the collocatedvideo block is coded with the first coding mode, both components of amotion vector of the collocated video block coded with the first codingmode are set to
 0. 7. The method of claim 1, wherein in response to adetermination that the collocated video block is coded with the firstcoding mode, the intra coding mode or the first coding mode, a flagindicating the availability of motion vectors of the collocated videoblock is set to 0 and both components of a motion vector for thecollocated video block are set to
 0. 8. The method of claim 1, whereinthe derivation process for the motion information of the collocatedvideo block coded with the first coding mode, the intra coding mode orthe second coding mode is different from the derivation process for themotion information of the collocated video block coded with an intercoding mode.
 9. The method of claim 1, wherein the prediction mode is asubblock-based temporal motion vector prediction (SbTMVP) mode, thefirst coding mode is a palette mode and the second coding mode is anintra-block copy (IBC) mode.
 10. The method of claim 1, wherein theconversion includes encoding the video block into the bitstream.
 11. Themethod of claim 1, wherein the conversion includes decoding the videoblock from the bitstream.
 12. An apparatus for processing video datacomprising a processor and a non-transitory memory with instructionsthereon, wherein the instructions upon execution by the processor, causethe processor to: perform a conversion between a video block of acurrent picture of a video and a bitstream of the video based on aprediction mode, wherein in the prediction mode, the video block isdivided into at least one subblock, and motion information of the atleast one subblock is derived based on motion information of acollocated video block in a collocated picture of the current picture,and wherein a position of the collocated video block is derived based ona temporal motion information which is initialized to a default motioninformation and is set to specific motion information related to aspecific neighboring block Al which is adjacent to a lower left cornerto the video block in response to the specific neighboring block isavailable, wherein in the prediction mode, a derivation process for themotion information of the collocated video block comprises: making afirst determination about whether the collocated video block is codedwith a first coding mode, wherein in the first coding mode,reconstructed samples are represented by a set of representative colorvalues, and the set of representative color values comprises at leastone of 1) palette predictors, 2) escaped samples, or 3) paletteinformation included in the bitstream; and making a seconddetermination, based on the first determination, about an availabilityof motion vectors of the collocated video block and values of motionvectors of the collocated video block, and wherein the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with the first codingmode and for the collocated video block coded with an intra coding modeor a second coding mode, wherein in the second coding mode, predictionsamples are derived from blocks of sample values of same decoded sliceas determined by a block vector.
 13. The apparatus of claim 12, whereinthe second determination determines the availability of motion vectorsof the collocated video block to be unavailable in response to the firstdetermination that the collocated video block is coded with the firstcoding mode.
 14. The apparatus of claim 12, wherein the availability ofmotion vectors of the collocated video block coded with the first codingmode is identical for the availability of motion vectors of thecollocated video block coded with the intra coding mode or the secondcoding mode.
 15. The apparatus of claim 13, wherein in response to thefirst determination that the collocated video block is coded with thefirst coding mode, a flag indicating the availability of motion vectorsof the collocated video block is set to
 0. 16. The apparatus of claim12, wherein the second determination determines the values of motionvectors of the collocated video block coded with the first coding modeto be equal to the values of motion vectors of the collocated videoblock coded with the intra coding mode or the second coding mode.
 17. Anon-transitory computer-readable storage medium storing instructionsthat cause a processor to: perform a conversion between a video block ofa current picture of a video and a bitstream of the video based on aprediction mode, wherein in the prediction mode, the video block isdivided into at least one subblock, and motion information of the atleast one subblock is derived based on motion information of acollocated video block in a collocated picture of the current picture,and wherein a position of the collocated video block is derived based ona temporal motion information which is initialized to a default motioninformation and is set to specific motion information related to aspecific neighboring block Al which is adjacent to a lower left cornerto the video block in response to the specific neighboring block isavailable, wherein in the prediction mode, a derivation process for themotion information of the collocated video block comprises: making afirst determination about whether the collocated video block is codedwith a first coding mode, wherein in the first coding mode,reconstructed samples are represented by a set of representative colorvalues, and the set of representative color values comprises at leastone of 1) palette predictors, 2) escaped samples, or 3) paletteinformation included in the bitstream; and making a seconddetermination, based on the first determination, about an availabilityof motion vectors of the collocated video block and values of motionvectors of the collocated video block, and wherein the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with the first codingmode and for the collocated video block coded with an intra coding modeor a second coding mode, wherein in the second coding mode, predictionsamples are derived from blocks of sample values of same decoded sliceas determined by a block vector.
 18. The non-transitorycomputer-readable storage medium of claim 17, wherein the seconddetermination determines the availability of motion vectors of thecollocated video block to be unavailable in response to the firstdetermination that the collocated video block is coded with the firstcoding mode.
 19. A non-transitory computer-readable recording mediumstoring a bitstream of a video which is generated by a method performedby a video processing apparatus, wherein the method comprises:generating the bitstream of the video from a video block of a currentpicture of the video based on a prediction mode, wherein in theprediction mode, the video block is divided into at least one subblock,and motion information of the at least one subblock is derived based onmotion information of a collocated video block in a collocated pictureof the current picture, and wherein a position of the collocated videoblock is derived based on a temporal motion information which isinitialized to a default motion information and is set to specificmotion information related to a specific neighboring block Al which isadjacent to a lower left corner to the video block in response to thespecific neighboring block is available, wherein in the prediction mode,a derivation process for the motion information of the collocated videoblock comprises: making a first determination about whether thecollocated video block is coded with a first coding mode, wherein in thefirst coding mode, reconstructed samples are represented by a set ofrepresentative color values, and the set of representative color valuescomprises at least one of 1) palette predictors, 2) escaped samples, or3) palette information included in the bitstream; and making a seconddetermination, based on the first determination, about an availabilityof motion vectors of the collocated video block and values of motionvectors of the collocated video block, and wherein the seconddetermination is performed such that the second determination isidentical for the collocated video block coded with the first codingmode and for the collocated video block coded with an intra coding modeor a second coding mode, wherein in the second coding mode, predictionsamples are derived from blocks of sample values of same decoded sliceas determined by a block vector.
 20. The non-transitorycomputer-readable recording medium of claim 19, wherein the seconddetermination determines the availability of motion vectors of thecollocated video block to be unavailable in response to the firstdetermination that the collocated video block is coded with the firstcoding mode.